Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups

70 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

XPIR : Private Information Retrieval for Everyone (2016, background): “First and foremost this paper shows that cPIR is a usable primitive in a large variety of settings, with standard security assumptions and conservative parameter choices.”
Revisiting the Computational Practicality of Private Information Retrieval (2011, background): “This is an important clarification to make because PIR-processing with most multi-server PIR schemes and some single-server PIR schemes [2, 29] costs much less than one modular multiplication per database bit.”
Scalable and Private Media Consumption with Popcorn (2016, background): “ous CPIR implementations [11, 30, 41, 70, 72, 80, 87, 97, 99, 103], among which XPIR [11] is the fastest.”
PRISM - Privacy-Preserving Search in MapReduce (2012, methodology): “That is, given b · ei, the probability that A computes low order bits of ei mod N (“LSB”) is negligible [37].”
Efficient Private File Retrieval by Combining ORAM and PIR (2014, methodology): “Similar to previous work [2], we have used the PIR scheme from Trostle and Parrish [20], because of its conceptual simplicity and efficient server computation (adding two PIR values is simply an integer addition).”