Nearly Private Information Retrieval
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.
KeywordsCommunication Cost Random String Privacy Requirement Private Information Retrieval Decodable Code
Unable to display preview. Download preview PDF.
- 7.Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. American Mathematical Society (2002)Google Scholar
- 8.Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 124–133. IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
- 10.Razborov, A., Yekhanin, S.: An Ω(n 1/3) lower bound for bilinear group based private information retrieval. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 739–748. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
- 11.Woodruff, D., Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. In: Proc. 20th Annual IEEE Conference on Computational Complexity, 2005, pp. 275–284. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
- 12.Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. In: Proc. 39th Annual ACM Symposium on the Theory of Computing, ACM Press, New York (to appear, 2007)Google Scholar