Upper bound on the communication complexity of private information retrieval

  • Andris Ambainis
Session 9: Algorithms II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)

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