Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation
Classical and Quantum Computation
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
A tight lower bound for restricted PIR protocols
Computational Complexity
An \Omega(n^1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Towards 3-query locally decodable codes of subexponential length
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the client requested. This concept is well studied in the theoretical computer science literature. Here, we study a generalization of this idea where we allow a small amount of information about the client's intent to be leaked. Despite having relaxed the privacy requirement, we are able to prove three fairly strong lower bounds on such schemes, for various parameter settings. These bounds extend previously known lower bounds in the traditional setting of perfect privacy and, in one case, improve upon the previous best result that handled imperfect privacy.