Upper bound on the communication complexity of private information retrieval

  • Andris Ambainis
Session 9: Algorithms II

DOI: 10.1007/3-540-63165-8_196

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)
Cite this paper as:
Ambainis A. (1997) Upper bound on the communication complexity of private information retrieval. In: Degano P., Gorrieri R., Marchetti-Spaccamela A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg

Abstract

We construct a scheme for private information retrieval with k databases and communication complexity O(n1/(2k−1)).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Andris Ambainis
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia

Personalised recommendations