A tight lower bound for restricted PIR protocols

Authors:
Richard Beigel;Lance Fortnow;William Gasarch
Affiliations:
Department of Computer and Information Sciences, Temple University, Philadelphia, PA;Department of Computer Science, University of Chicago, Chicago, IL;University of Maryland, Department of Computer Science and Institute for Advanced Computer Studies, College Park, MD
Venue:
Computational Complexity
Year:
2006

Citing 10
Cited 5

On the power of two-local random reductions

Information Processing Letters
Computationally private information retrieval (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Private information retrieval

Journal of the ACM (JACM)
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Upper Bound on Communication Complexity of Private Information Retrieval

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Replication is not needed: single database, computationally-private information retrieval

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Exponential lower bound for 2-query locally decodable codes via a quantum argument

Journal of Computer and System Sciences - Special issue: STOC 2003
Computationally private information retrieval with polylogarithmic communication

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Improved lower bounds for locally decodable codes and private information retrieval

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Towards 3-query locally decodable codes of subexponential length

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Towards 3-query locally decodable codes of subexponential length

Journal of the ACM (JACM)
Private predictions on hidden Markov models

Artificial Intelligence Review
Nearly private information retrieval

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Complexity upper bounds for classical locally random reductions using a quantum computational argument

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 de Wolf while avoiding their use of quantum techniques.