43 search results - page 2 / 9 » On Basing Private Information Retrieval on NP-Hardness |
EUROCRYPT
2000
Springer
13 years 9 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....
IWSEC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. With the digitization of society and the continuous migration of services to the electronic world, individuals have lost significant control over their data. In this pap...
ACISP
2004
Springer
13 years 10 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...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
ECCC
2006
13 years 5 months ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...