A tight lower bound for restricted pir protocols

Abstract.We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are one bit long must ask questions that are at least n−2 bits long, which is nearly equal to the known n−1 upper bound. This improves upon the approximately 0.25n lower bound of Kerenidis and deWolf while avoiding their use of quantum techniques.

[1]  Lance Fortnow,et al.  On the Power of Two-Local Random Reductions , 1992, Inf. Process. Lett..

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

[3]  Ronald de Wolf,et al.  Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.

[4]  William I. Gasarch,et al.  A Survey on Private Information Retrieval (Column: Computational Complexity) , 2004, Bull. EATCS.

[5]  Yuval Ishai,et al.  Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

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

[8]  Ronald de Wolf,et al.  Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.

[9]  Luca Trevisan,et al.  Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

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

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

[12]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

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