论文信息 - A Nearly Tight Lower Bound for Private Information Retrieval Protocols

A Nearly Tight Lower Bound for Private Information Retrieval Protocols

We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-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 de Wolf while avoiding their use of quantum techniques.

Lance Fortnow | Richard Beigel | William Gasarch

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

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

[3] Lance Fortnow,et al. On the Power of Two-Local Random Reductions , 1991, ASIACRYPT.

[4] 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..

[5] E. Kushilevitz,et al. Barrier for Information-Theoretic Private Information Retrieval , 2002 .

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