31 search results - page 1 / 7 » Single Database Private Information Retrieval with Logarithm... |
108
Voted
ACISP
2004
Springer
15 years 6 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...
110
click to vote
ICALP
2005
Springer
15 years 6 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...
110
Voted
FOCS
1997
IEEE
15 years 5 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...
121
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
132
Voted
ISW
2010
Springer
14 years 11 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...