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

2002921 citationsJournal Article

Authors

Eyal Kushilevitz · Technion – Israel Institute of Technology

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.

Topics & Keywords

Cryptography and Data Security Complexity and Algorithms in Graphs Privacy-Preserving Technologies in Data

UN Sustainable Development Goals

Partnerships for the goals

Publication Details

DOI: 10.1109/sfcs.1997.646125

Field-Weighted Citation Impact: 27.53