Single-database private information retrieval with constant communication rate

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 803-815

  Gentry, Craig ^a   Ramzan, Zulfikar ^a  

^a DOCOMO USA LABS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATABASE SYSTEMS; PARAMETER ESTIMATION;

COMMUNICATION COMPLEXITY; DATABASE SIZE; PRIVATE INFORMATION RETRIEVAL (PIR);

INFORMATION RETRIEVAL;

EID: 26444512068     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_65     Document Type: Conference Paper

References (16)

1. 1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval, FOCS 2002.
2. C. Cachin, S. Micali, M. Stadler, Computational Private Information Retrieval with Polylogarithmic Communication, Eurocrypt 1999.
3. Y. Chang. Single-Database Private Information Retreival with Logarithmic Communication, ACISP 2004.
4. B. Chor and N. Gilboa, Comput. Private Information Retrieval, STOC 1997.
5. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, Private Information Retrieval, Journal of the ACM, 45, 1998. Earlier version in FOCS 95.
6. D. Coppersmith, Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known, Eurocrypt 1996.
7. D. Coppersmith, Finding a Small Root of a Univ. Mod. Equation, Eurocrypt 1996.
8. I. Damgard and M. Koprowski, Generic Lower Bounds for Root Extraction and Signature Schems in General Groups, Eurocrypt 2002.
9. E. Kushilevits and R. Ostrovsky, Replication is not needed: single database, computationally private information Retrieval. FOCS 1997.
10. A.K. Lenstra and H.W. Lenstra, Jr., (eds.), The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, 1995.
11. H. Lipmaa, An Oblivious Transfer Protocol with Log-Squared Communication. Cryptology ePrint Archive, 2004/063.
12. A. May, A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, Eurocrypt 2005.
13. M. Naor and B. Pinkas, Obl. Transfer and Polynomial Evaluation, STOC 1999.
14. S.C. Pohlig and M. Hellman. An Improved Algorithm for Computing Logarithms Over GF(p) and its Crypt. Significance, IEEE Trans. Inf. Th. IT-24 (1978).
15. J.B. Rosser and L. Schoenfeld, Sharper Bounds for Chebyshev Functions θ(x) and ψs(x), Math. Comput. 29, 243-269, 1975.
16. J.P. Stern, A New and Efficient All or Nothing Disclosure of Secrets Protocol, Asiacrypt 1998.