Sciweavers

Share
EUROCRYPT
2000
Springer

One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval

12 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. More specifically, we present a protocol in which the user sends O(K2 ) bits and the server sends n- cn K bits (for any constant c), where K is the security parameter of the trapdoor permutations. Thus, for sufficiently large databases (e.g., when K = n for some small ) our construction breaks the informationtheoretic lower-bound (of at least n bits). This demonstrates the feasibility of basing single-server private information retrieval on general complexity assumptions. An important implication of our result is that we can implement a 1-outof-n Oblivious Transfer protocol with communication complexity strictly less than n based on any one-way trapdoor permutation.
Eyal Kushilevitz, Rafail Ostrovsky
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where EUROCRYPT
Authors Eyal Kushilevitz, Rafail Ostrovsky
Comments (0)
books