Replication is not needed: single database, computationally-private information retrieval

  • Authors:
  • E. Kushilevitz;R. Ostrovsky

  • Affiliations:
  • -;-

  • Venue:
  • FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1997

Quantified Score

Hi-index 0.08

Visualization

Abstract

We establish the following, quite unexpected, result: replication of data for the computational private information retrieval problem is not necessary. More specifically, based on the quadratic residuosity assumption, we present a single database, computationally private information retrieval scheme with O(n/sup /spl epsiv//) communication complexity for any /spl epsiv/0.