Sciweavers

6 search results - page 1 / 2
» Single Database Private Information Retrieval Implies Oblivi...
Sort
View
72
Voted
EUROCRYPT
2000
Springer
15 years 1 months ago
Single Database Private Information Retrieval Implies Oblivious Transfer
Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsk...
ACISP
2004
Springer
15 years 3 months ago
Single Database Private Information Retrieval with Logarithmic Communication
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...
Yan-Cheng Chang
EUROCRYPT
2000
Springer
15 years 1 months ago
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
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....
Eyal Kushilevitz, Rafail Ostrovsky
CCS
2010
ACM
15 years 1 months ago
Controlling data disclosure in computational PIR protocols
Private Information Retrieval (PIR) protocols allow users to learn data items stored at a server which is not fully trusted, without disclosing to the server the particular data e...
Ning Shang, Gabriel Ghinita, Yongbin Zhou, Elisa B...
CCS
2011
ACM
13 years 9 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg