Robust information-theoretic private information retrieval

Journal of Cryptology

Volumn 20, Issue 3, 2007, Pages 295-321

  Beimel, Amos ^a   Stahl, Yoav ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distributed databases; Fault tolerance computation; Information theoretic secure protocols; Privacy

Indexed keywords

BYZANTINE SERVERS; COMMUNICATION PROBLEMS; GENERIC TRANSFORMATION; PIR PROTOCOLS;

DATA PRIVACY; DATABASE SYSTEMS; NETWORK PROTOCOLS; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; ROBUST CONTROL; SERVERS; USER INTERFACES;

INFORMATION RETRIEVAL;

EID: 34547151180     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-007-0424-2     Document Type: Article

References (67)

1. N. Alon. Explicit construction of exponential sized families of k-independent sets. Discrete Math., 58:191-193, 1986.
2. N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.
3. A. Ambainis. Upper bound on the communication complexity of private information, retrieval. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of the 24th International Colloquium on Automata, Languages and Programming, pages 401-407. Volume 1256 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1997.
4. M. Atici, S. S. Magliveras, D. R. Stinson, and W. D. Wei. Some recursive constructions for perfect hash families. J. Combin. Des., 4:353-363, 1996.
5. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In C. Choffrut and T. Lengauer, editors, STACS '90, 7th Symp. on Theoretical Aspects of Computer Science, pages 37-48. Volume 415 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1990.
6. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: improvements and applications. J. Cryptology, 10(1):17-36, 1997. Early version: Security with small communication overhead, CRYPTO '90, pages 62-76. Volume 537 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991.
7. R. Beigel, L. Fortnow, and W. Gasarch. Nearly tight bounds for private information retrieval systems. Comput. Complexity, 15(1):82-91, 2006.
8. A. Beimel and Y. Ishai. Information-theoretic private information retrieval: a unified construction. In P. G. Spirakis and J. van Leeuven, editors, Proc. of the 28th International Colloquium on Automata, Languages and Programming, pages 912-926. Volume 2076 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001. Journal version in [9].
9. A. Beimel, Y. Ishai, and E. Kushilevitz. General constructions for information-theoretic private information retrieval. J. Comput. System Sci., 71(2):213-247, 2005. Journal version of [37] and [8].
10. A. Beimel, Y. Ishai, E. Kushilevitz, and T. Malkin. One-way functions are essential for single-server private information retrieval. In Proc. of the 31st ACM Symp. on the Theory of Computing, pages 89-98, 1999.
11. 1/(2k-1)) barrier for information-theoretic private information retrieval. In Proc. of the 43rd IEEE Symp. on Foundations of Computer Science, pages 261-270, 2002.
12. A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers' computation in private information retrieval: PIR with preprocessing. J. Cryptology, 17(2): 125-151, 2004. Preliminary version: M. Bellare, editor, Advances in Cryptology - CRYPTO 2000, pages 56-74. Volume 1880 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
13. A. Beimel and Y. Stahl. Robust information-theoretic private information retrieval. In S. Cimato, C. Galdi, and G. Persiano, editors, Proc. of the 3rd Conf. on Security in Communication Networks, pages 326-341. Volume 2576 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
14. S. R. Blackburn. Combinatorial designs and their applications. Res. Notes Math., 403:44-70, 1999.
15. S. R. Blackburn. Perfect hash families: probabilistic methods and explicit constructions. J. Combin. Theory Ser. A, 92:54-60, 2000.
16. S. R. Blackburn, M. Burmester, Y. Desmedt, and P. R. Wild. Efficient multiplicative sharing schemes. In U. Maurer, editor, Advances in Cryptology - EUROCRYPT '96, pages 107-118. Volume 1070 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
17. S. R. Blackburn and P. R. Wild. Optimal linear perfect hash families. J. Combin. Theory Ser. A, 83:233-250, 1998.
18. G. R. Blakley. Safeguarding cryptographic keys. In R. E. Merwin, J. T. Zanca, and M. Smith, editors, Proc. of the 1979 AFIPS National Computer Conf, pages 313-317. Volume 48 of AFIPS Conference Proceedings. AFIPS Press, Reston, VA, 1979.
19. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, pages 402-414. Volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
20. R. Canetti, Y. Ishai, R. Kumar, M. K. Reiter, R. Rubinfeld, and R. N. Wright. Selective private function, evaluation with applications to private statistics. In. Proc. of the 20th ACM Symp. on Principles of Distributed Computing, pages 293-304, 2001.
21. Y.-C. Chang. Single database private information retrieval with logarithmic communication. In Information Security and Privacy: 9th Australasian Conf, ACISP 2004, pages 50-61. Volume 3108 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004.
22. B. Chor and N. Gilboa. Computationally private information retrieval. In Proc. of the 29th ACM Symp. on the Theory of Computing, pages 304-313, 1997.
23. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. of the 36th IEEE Symp. on Foundations of Computer Science, pages 41-5.1, 1995. Journal version: J. ACM, 45:965-981, 1998.
24. Z. J. Czech, G. Havas, and B. S. Majewski. Perfect hashing. Theoret. Comput. Sci., 182:1-143, 1997.
25. A. Deshpande, R. Jain, T Kavita, V. Lokam, and J. Radhakrishnan. Lower bounds for adaptive locally decodable codes. Random Structures Algorithms, 27(3):358-378,2005. Conference version: Proc. of the 17th IEEE Conf. on Computational Complexity, pages 184-193, 2002.
26. G. Di-Crescenzo, Y. Ishai, and R. Ostrovsky. Universal service-providers for private information retrieval. J. Cryptology, 14(1):37-74, 2001. Preliminary version in Proc. of the 17 th ACM Symp. on Principles of Distributed Computing, pages 91-100, 1998.
27. G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Advances in Cryptology - EUROCRYPT 2000, pages 122-138. Volume 1807 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
28. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. In P. G. Spirakis and J. van. Leeuven, editors, Proc. of the 28th International Colloquium on Automata, Languages and Programming, pages 927-938. Volume 2076 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
29. A. Fiat and M. Naor. Broadcast encryption. In D. R. Stinson, editor, Advances in Cryptology - CRYPTO '93, pages 480-491. Volume 773 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
30. M. L. Fredman and J. Komlós. On the size of separating systems and families of perfect hash functions. SIAM J. Algebraic Discrete Methods, 5:61-68, 1984.
31. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
32. W. Gasarch. A survey on private information retrieval. Bull. Eur: Assoc. Theor: Comput. Sci., 82:72-107, 2004. Can also be found at: http://www.cs.umd.edu/~gasarch/pir/pir.html.
33. C. Gentry and Z. Ramzan. Single-database private information retrieval with constant communication rate. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors, Proc. of the 32nd International Colloquium on Automata, Languages and Programming, pages 803-815. Volume 3580 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2005.
34. Y. Gertner, S. Goldwasser, and T. Malkin. A random server model for private information retrieval. In M. Luby, J. Rolim, and M. Serna, editors, RANDOM '98, 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, pages 200-217. Volume 1518 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
35. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. J. Comput. System Sci., 60(3):592-629, 2000. Conference version in Proc. of the 30th ACM Symp. on the Theory of Computing, pages 151-160, 1998.
36. O. Goldreich, H. Karloff, L. J. Schulman, and L. Trevisan. Lower bounds for linear locally decodable codes and PIR. In Proc. of the 17th IEEE Conf. on Computational Complexity, pages 175-183, 2002.
37. Y. Ishai and E. Kushilevitz. Improved upper bounds on information theoretic private information retrieval. In Proc. of the 31st ACM Symp. on the Theory of Computing, pages 79-88, 1999. Journal version in [9].
38. T. Itoh. Efficient private information retrieval. IEICE Trans. Fund. Electron. Commun. Comput. Sci., E82-A(1):11-20, 1999.
39. T. Itoh. On lower bounds for the communication complexity of private information retrieval. IEICE Trans. Fund. Electron. Commun. Comput. Sci., E84-A(1): 157-164, 2001.
40. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. of the 32nd ACM Symp. on the Theory of Computing, pages 80-86, 2000.
41. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum. argument. J. Comput. System Sci., 69(3):395-420, 2004.
42. J. Korner and Marton. New bounds for perfect hashing via information theory. Eur. J. Combin., 9:523-530, 1988.
43. E. Kushilevitz and R. Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science, pages 364-373, 1997.
44. E. Kushilevitz and R. Ostrovsky. One-way trapdoor permutations are sufficient for single-database computationally-private information retrieval. In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, pages 104-121. Volume 1807 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
45. H. Lipmaa. An oblivious transfer protocol with log-squared communication. In J. Zhou and J. Lopez, editors, Pmc. of the 8th Information Security Conference (ISC'05), pages 314-328. Volume 3650 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2005.
46. F. R. Macwilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. Mathematical library. North-Holland, Amsterdam, 1978.
47. E. Mann. Private access to distributed information. Master's thesis, Technion - Israel Institute of Technology, Haifa, 1998.
48. K. Mehlhorn. Data Structures and Algorithms, volume 1. Sorting and Searching. Springer-Verlag, New York, 1984.
49. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
50. M. Naor and B. Pinkas. Oblivious transfer and polynomial evalutation. In Proc. of the 31st ACM Symp. on the Theory of Computing, pages 245-254, 1999.
51. I. Newman and A. Wigderson. Lower bounds on formula size of Boolean functions using hypergraph entropy. SIAM J. Discrete Math., 8:536-542, 1995.
52. K. Obata. Optimal lower bounds for 2-query locally decodable linear codes. In J. D. P. Rolim and S. Vadhan, editors, RANDOM '02, 6th International Workshop on Randomization and Approximation Techniques in Computer Science, pages 39-50. Volume 2483 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
53. R. Ostrovsky and V. Shoup. Private information storage. In Proc. of the 29th ACM Symp. on the Theory of Computing, pages 294-303, 1997.
54. 1/3) lower bound for bilinear group based private information retrrieval. In Proc. of the 47th IEEE Symp. on Foundations of Computer Science, 2006.
55. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. J. SIAM, 8:300-304, 1960.
56. A. Shamir. How to share a secret. Commun. ACM, 22:612-613, 1979.
57. D. Shiowattana and S. V. Lokam. An optimal lower bound for 2-query locally decodable linear codes. Inform. Process. Lett., 97(6):244-250, 2006.
58. C. Slot and P. van Emde Boas. On tape versus core; an application of space efficient perfect hash functions to the invariance of space. In Proc. of the 16th ACM Symp. on the Theory of Computing, pages 391-400, 1984.
59. R. Sprugnoli. Perfect hashing functions: a single probe retrieving method for static sets. Commun. ACM, 20(11):841-850, 1977.
60. J. P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol. In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT '98, pages 357-371. Volume 1514 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
61. D. Stinson, T. van Trung, and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Statist. Plann. Inference, 86(2):595-617, 2000.
62. D. R. Stinson, R. Wei, and L. Zhu. New constructions for perfect hash families and related structures using combinatorial designs and codes. J. Combin. Designs, 8:189-200, 2000.
63. R. E. Tarjan and A. C. Yao. Storing a sparse table. Commun. ACM, 22(11):606-611, 1979.
64. S. Wehner and R. de Wolf. Improved lower bounds for locally decodable codes and private information retrieval. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors, Proc. of the 32nd International Colloquium on Automata, Languages and Programming, pages 1424-1436. Volume 3580 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2005.
65. D. Woodruff and S. Yekhanin. A geometric approach, to information-theoretic private information retrieval. In. Proc. of the 20th IEEE Conf. on Computational Complexity, pages 275-284, 2005.
66. A. Yamamura and T. Saito. Private information retrieval based on the subgroup membership problem. In V. Varadharajan and Y. Mu, editors, ACISP 2001, pages 206-220. Volume 2119 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
67. E. Y. Yang, J. Xu, and K. H. Bennett. Private information retrieval in the presence of malicious failures. In Proc. of the 26th IEEE International Computer Software and Applications Conference, pages 805-812, 2002.