3 search results - page 1 / 1 » Multi-query Computationally-Private Information Retrieval wi... |
PKC
2010
Springer
13 years 8 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
2005
Springer
13 years 10 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...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...