Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval

Private information retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of retrieving one out of n bits of data. For any fixed k, the complexity of the best protocols prior to our work was O(n/sup 1/2k-1/). Since then several methods were developed in an attempt to beat this bound, but all these methods yielded the same asymptotic bound. In this paper, this barrier is finally broken and the complexity of information-theoretic k-server PIR is improved to n/sup O(log log k/k log k)/. The new PIR protocols can also be used to construct k-query binary locally decodable codes of length exp(n/sup O(log log k/k log k)/), compared to exp(n/sup 1/k-1/) in previous constructions. The improvements presented in this paper apply even for small values of k: the PIR protocols are more efficient than previous ones for every k/spl ges/3, and the locally decodable codes are shorter for every k/spl ges/4.

[1]  Jaikumar Radhakrishnan,et al.  Better lower bounds for locally decodable codes , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[2]  Aggelos Kiayias,et al.  Secure Games with Polynomial Expressions , 2001, ICALP.

[3]  William Gasarch.  A Survey on Private Information Retrieval , 2004 .

[4]  Rafail Ostrovsky,et al.  Single Database Private Information Retrieval Implies Oblivious Transfer , 2000, EUROCRYPT.

[5]  Andris Ambainis,et al.  On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .

[6]  Satyanarayana V. Lokam,et al.  Simultaneous Messages vs. Communication , 1995, STACS.

[7]  Yuval Ishai,et al.  Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing , 2000, CRYPTO.

[8]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

[9]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Julien P. Stern.  A New Efficient All-Or-Nothing Disclosure of Secrets Protocol , 1998, ASIACRYPT.

[11]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[12]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[13]  Yuval Ishai,et al.  Protecting data privacy in private information retrieval schemes , 1998, STOC '98.

[14]  Niv Gilboa,et al.  Computationally private information retrieval (extended abstract) , 1997, STOC '97.

[15]  Toshiya Itoh,et al.  Efficient Private Information Retrieval , 1999 .

[16]  Moni Naor,et al.  Communication preserving protocols for secure function evaluation , 2001, STOC '01.

[17]  Joan Feigenbaum,et al.  Secure Multiparty Computation of Approximations , 2001, ICALP.

[18]  Rafail Ostrovsky,et al.  Private Information Storage , 1996, IACR Cryptol. ePrint Arch..

[19]  Julien P. Stern.  A new and efficient all-or-nothing disclosure of secrets protocol , 1998 .

[20]  Tal Malkin,et al.  A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication , 1997 .

[21]  Luca Trevisan,et al.  Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..

[22]  Yuval Ishai,et al.  Improved upper bounds on information-theoretic private information retrieval , 1999, STOC 1999.

[23]  Yuval Ishai,et al.  Information-Theoretic Private Information Retrieval: A Unified Construction , 2001, ICALP.

[24]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[25]  T. Itoh.  On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .

[26]  Yan-Cheng Chang,et al.  Single Database Private Information Retrieval with Logarithmic Communication , 2004, ACISP.

[27]  Satyanarayana V. Lokam,et al.  Communication Complexity of Simultaneous Messages , 2003, SIAM J. Comput..

[28]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[29]  Kenji Obata,et al.  Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes , 2002, RANDOM.

[30]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[31]  Yuval Ishai,et al.  Selective private function evaluation with applications to private statistics , 2001, PODC '01.

[32]  Amos Beimel,et al.  Robust Information-Theoretic Private Information Retrieval , 2002, SCN.

[33]  Elizabeth D Mann.  Private access to distributed information , 1998 .

[34]  Lance Fortnow,et al.  Nearly tight bounds for private information retrieval systems , 2002 .

[35]  Rafail Ostrovsky,et al.  One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval , 2000, EUROCRYPT.