340 search results - page 2 / 68 » Computationally Private Information Retrieval with Polylogar... |
ACISP
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...