12 search results - page 3 / 3 » Reducing Complexity Assumptions for Oblivious Transfer |
EUROCRYPT
2000
Springer
13 years 11 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....
ACISP
2004
Springer
14 years 1 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...