Private information retrieval

Communications of the ACM

Volumn 53, Issue 4, 2010, Pages 68-73

  Yekhanin, Sergey ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PROTOCOLS; INDISPENSABLE RESOURCES; MARKET VALUES; PRIVATE INFORMATION RETRIEVAL; PUBLIC DATABASE; USER INTENTION; USER PRIVACY; USER QUERY;

CRYPTOGRAPHY; INFORMATION RETRIEVAL; INTERNET PROTOCOLS; PATENTS AND INVENTIONS;

DATABASE SYSTEMS;

EID: 77950365227     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1721654.1721674     Document Type: Article

References (26)

1. ambainis, a. Upper bound on the communication complexity of private information retrieval. In Proceedings of the Automata, Languages and Programming, 24th International Colloquium LNCS 1256 (bologna, Italy, July 7-11). springer, 1997, 401-407.
2. babai, L., Fortnow, L., Levin, L., and szegedy, M. Checking computations in polylogarithmic time. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (new orleans, La, May 5-8). aCM Press, new york, 1991, 21-31.
3. beimel, a., Ishai, y., and Kushilevitz, e. general constructions for information-theoretic private information retrieval. Journal of Computer and System Sciences 71, 2 (2005), 213-247.
4. 1/(2k-1)) barrier for information-theoretic private information retrieval. In Proceedings of the 43rd Symposium on Foundations of Computer Science (Vancouver, b.C., nov. 16-19). Ieee Computer society, 2002, 261-270.
5. beimel, a., Ishai, y., and Malkin, t. reducing the servers' computation in private information retrieval: PIr with preprocessing. In Proceedings of the 20th Annual International Cryptology Conference LNCS 1880 (santa barbara, Ca, aug. 20-24). springer, 2000, 55-73.
6. Cachin, C., Micali, s., and stadler, M. Computationally private information retrieval with polylogarithmic communication. In Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques LNCS 1592 (Prague, Czech republic, May 2-6). springer, 1999, 402-414.
7. Chor, b., goldreich, o., Kushilevitz, e., and sudan, M. Private information retrieval. Journal of the ACM 45, 6 (1998), 965-981.
8. efremenko, K. 3-query locally decodable codes of subexponential length. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (bethesda, Md, May 31-June 2). aCM Press, new york, 2009, 39-44.
9. Gasarch, W. Web page on private information retrieval; http://www.cs.umd.edu/gasarch/pir/pir. Html
10. gentry, C. and ramzan, Z. single-database private information retrieval with constant communication rate. In Proceedings of the 32nd International Colloquium on Automata, Languages and
11. Programming LNCS 3580 (Lisbon, Portugal, July 11-15). springer, 2005, 803-815.
12. Ishai, y., Kushilevitz, e., ostrovsky, r., and sahai, a. batch codes and their applications. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (Chicago, June 13-16). aCM Press, new york, 2004, 262-271
13. Itoh, t. and suzuki, y. new constructions for query-effcient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems E93-D, 2 (2010), 263-270.
14. Katz, J. and trevisan, L. on the effciency of local decoding procedures for error-correcting codes. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Portland, or, May 21-23). aCM Press, new york, 2000, 80-86.
15. Kerenidis, I. and de Wolf, r. exponential lower bound for 2-query locally decodable codes via a quantum argument. Journal of Computer and System Sciences 69, 3 (2004), 395-420.
16. Kushilevitz, e. and ostrovsky, r. replication is not needed: single-database computationally private information. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (Miami beach, FL, oct. 19-22). Ieee Computer society, 1997, 364-373.
17. Lipmaa, h. an oblivious transfer protocol with log-squared communication. In Proceedings of the 11th International Conference on Information Security LNCS 5222 (taipei, sept. 15-18). springer, 2008, 314-328.
18. ostrovsky, r. and sketch, W.e. III a survey of single database private information retrieval: techniques and applications. In Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography LNCS 4450 (beijing, apr. 16-20). springer, 2007, 393-411.
19. raghavendra, P. A Note on Yekhanin's Locally Decodable Codes Technical Report TR07-016. electronic Colloquium on Computational Complexity, 2007
20. sudan, M. Effcient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Ph.d. thesis, University of California, berkeley, 1992.
21. trevisan, L. some applications of coding theory in computational complexity. Quaderni di Matematica 13 (2004), 347-424.
22. Wehner, s. and de Wolf, r. Improved lower bounds for locally decodable codes and private information retrieval. In Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming LNCS 3580 (Lisbon, Portugal, July 11-15). springer, 2005, 1424-1436.
23. Woodruff, d. New Lower Bounds for General Locally Decodable Codes Technical Report TR07-006. electronic Colloquium on Computational Complexity, 2007.
24. Woodruff, d and yekhanin, s. a geometric approach to information theoretic private information retrieval. SIAM Journal on Computing 47, 4 (2007), 1046-1056.
25. yekhanin, s. towards 3-query locally decodable codes of subexponential length. Journal of the ACM 55, 1 (2008), 1-14
26. yekhanin, s. Locally Decodable Codes and Private Information Retrieval Schemes. Ph.d. thesis. Massachusetts Institute of technology, Cambridge, Ma, 2007; http://research.microsoft.com/en-us/um/people/yekhanin/Papers/phdthesis. pdf