A geometric approach to information-theoretic private information retrieval

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 275-284

  Woodruff, David ^a   Yekhanin, Sergey ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE WORK; POLYLOGARITHMIC NUMBER OF SERVERS; POLYNOMIAL PREPROCESSING; PRIVATE INFORMATION RETRIEVAL (PIR);

CONSTRAINT THEORY; INFORMATION RETRIEVAL; NETWORK PROTOCOLS; POLYNOMIALS; SERVERS;

INFORMATION THEORY;

EID: 27644594172     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Ambainis, "Upper bound on the communication complexity of private information retrieval," Proc. of 32th ICALP, LNCS 1256, pp. 401-407, 1997.
2. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. Proc. of STAGS '90, LNCS 415, pp. 37-48, 1990.
3. D. Beaver, J. Feigenbaum, J. Kilian and P. Rogaway. Locally Random Reductions: Improvements and Applications. In Journal of Cryptology, 10(1), pp. 17-36, 1997.
4. R. Beigel, L. Fortnow, and W. Gasarch. A nearly tight lower bound for private information retrieval protocols. Technical Report TR03-087, Electronic Colloquim on Computational Complexity (ECCC), 2003.
5. A. Beimel and Y. Ishai. Information-Theoretic Private Information Retrieval: A Unified Construction. In 28th ICALP, LNCS 2076, pp. 912-926, 2001.
6. A. Beimel, Y. Ishai, and E. Kushilevitz. General Constructions for Information-Theoretic Private Information Retrieval. Unpublished manuscript available at www.cs.bgu.ac.il/beimel/pub.html
7. A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond. Breaking the Barrier for Information-Theoretic Private Information Retrieval. In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 261-270, 2002.
8. A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers' computation in private information retrieval: Pir with preprocessing. In Crypto' 2000, LNCS 1880, pp. 56-74. 2000.
9. A. Beimel and Y. Stahl. Robust information-theoretic private information retrieval. In Proceedings of the 3rd conference on security in Communications networks (SCN), pp. 326-341, 2002.
10. B. Chor and N. Gilboa. Computationally private information retrieval. In Proc. of the 32th ACM Sym. on Theory of Computing (STOC), pp. 304-313, 2000.
11. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private information retrieval. In Proc. of the 36rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 41-50, 1995.
12. Also, in Journal of the ACM, 45, 1998.
13. B. Gasarch, A Webpage on Private Information Retrieval, http://www.cs.umd.edu/gasarch/pir/pir.html
14. R. Hartshorne, Algebraic geometry. New York: Springer, 1977.
15. Y. Ishai and E. Kushilevitz. Improved upper bounds on information-theoretic private information retrieval. In Proc. of the 31th ACM Sym. on Theory of Computing (STOC), pp. 79-88, 1999.
16. R. Lidl and H. Niederreiter, Finite Fields. Cambridge: Cambridge University Press, 1985.
17. T. Nagell. Introduction to Number Theory. New York: Wiley, 1951.
18. A. Shamir. How to share a secret. Communications of ACM, 22:612-613, 1979.
19. S. Wehner and R. de Wolf, "Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval, " preprint available from the LANL quantph archive 0403140, 2004.