scholarly journals General constructions for information-theoretic private information retrieval

2005 ◽  
Vol 71 (2) ◽  
pp. 213-247 ◽  
Author(s):  
Amos Beimel ◽  
Yuval Ishai ◽  
Eyal Kushilevitz
2016 ◽  
Vol 2016 (4) ◽  
pp. 184-201 ◽  
Author(s):  
Raphael R. Toledo ◽  
George Danezis ◽  
Ian Goldberg

Abstract Private Information Retrieval (PIR), despite being well studied, is computationally costly and arduous to scale. We explore lower-cost relaxations of information-theoretic PIR, based on dummy queries, sparse vectors, and compositions with an anonymity system. We prove the security of each scheme using a flexible differentially private definition for private queries that can capture notions of imperfect privacy. We show that basic schemes are weak, but some of them can be made arbitrarily safe by composing them with large anonymity systems.


Sign in / Sign up

Export Citation Format

Share Document