Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval (Extended Abstract) (1997)
by
Eyal Kushilevitz
,
Rafail Ostrovsky
| Venue: | IN PROC. OF THE 38TH ANNU. IEEE SYMP. ON FOUNDATIONS OF COMPUTER SCIENCE |
| Citations: | 170 - 16 self |
BibTeX
@INPROCEEDINGS{Kushilevitz97replicationis,
author = {Eyal Kushilevitz and Rafail Ostrovsky},
title = {Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval (Extended Abstract)},
booktitle = {IN PROC. OF THE 38TH ANNU. IEEE SYMP. ON FOUNDATIONS OF COMPUTER SCIENCE},
year = {1997},
pages = {364--373},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 ffl ) communication complexity for any ffl ? 0.
