Advertisement

Nearly Private Information Retrieval

  • Amit Chakrabarti
  • Anna Shubina
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4708)

Abstract

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.

Keywords

Communication Cost Random String Privacy Requirement Private Information Retrieval Decodable Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 175(2), 139–159 (1996)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Beigel, R., Fortnow, L., Gasarch, W.: A tight lower bound for restricted PIR protocols. Comput. Complexity 15(1), 82–91 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 56–74. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. J. ACM 45(6), 965–982 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Goldreich, O., Karloff, H., Schulman, L., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. In: Proc. 17th Annual IEEE Conference on Computational Complexity, pp. 175–183. IEEE Computer Society Press, Los Alamitos (2002)CrossRefGoogle Scholar
  6. 6.
    Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes. J. Comput. Syst. Sci. 69(3), 395–420 (2004) (Preliminary version in Proc. 35th Annual ACM Symposium on the Theory of Computing, pp.106–115 (2003))zbMATHCrossRefGoogle Scholar
  7. 7.
    Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. American Mathematical Society (2002)Google Scholar
  8. 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
  9. 9.
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
  10. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Amit Chakrabarti
    • 1
  • Anna Shubina
    • 1
  1. 1.Department of Computer Science, Dartmouth College, Hanover, NH 03755USA

Personalised recommendations