Robust information-theoretic private information retrieval

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2576, Issue , 2003, Pages 326-341

  Beimel, Amos ^a   Stahl, Yoav ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DATABASE SYSTEMS; INFORMATION RETRIEVAL;

COMMUNICATION COMPLEXITY; COMMUNICATION PROBLEMS; DATA ITEMS; DIFFERENT PROTOCOLS; GAIN INFORMATION; GENERIC TRANSFORMATIONS; PRIVATE INFORMATION RETRIEVAL; STANDARD DEFINITIONS;

INFORMATION THEORY;

EID: 35248899190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36413-7_24     Document Type: Article

References (30)

1. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th FOCS. (1995) 41-51.
2. J. version: JACM, 45:965-981, 1998.
3. Ishai, Y., Kushilevitz, E.: Improved upper bounds on information theoretic private information retrieval. In: 31st STOC. (1999) 79-88
4. Ambainis, A.: Upper bound on the communication complexity of private information retrieval. In: 24th ICALP. Vol. 1256 of LNCS. (1997) 401-407
5. Itoh, T.: Efficient private information retrieval. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences E82-A (1999) 11-20
6. Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: A unified construction. In: 28th ICALP. Vol. 2076 of LNCS. (2001) 912-926
7. 1/2k-1) barrier for inforamtion-theoretic private information retrieval. In: 43rd FOCS. (2002) To Appear.
8. Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: STACS '90. Vol. 415 of LNCS. (1990) 37-48
9. Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Locally random reductions: Improvements and applications. J. of Cryptology 10 (1997) 17-36
10. Stahl, Y.: Robust information-theoretic private information retrieval. Master's thesis, Ben-Gurion University, Beer-Sheva (2002)
11. Mehlhorn, K.: Data structures and Algorithms. Volume 1. Sorting and Searching. Springer-Verlag (1984)
12. Newman, I., Wigderson, A.: Lower bounds on formula size of Boolean functions using hypergraph entropy. SIAM J. on Discrete Mathematics 8 (1995) 536-542
13. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16 (1996) 434-449
14. Blackburn, S.R.: Combinatorial designs and their applications. Research Notes in Mathematics 403 (1999) 44-70
15. Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In EUROCRYPT '96. Volume 1070 of LNCS. (1996) 107-118
16. Fiat, A., Naor, M.: Broadcast encryption. In CRYPTO '93. Volume 773 of LNCS. (1994) 480-491
17. Stinson, D., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. of Statistical Planning and Inference 86(2) (2000) 595-617
18. Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discrete Math. 58 (1986) 191-193
19. Atici, M., Magliveras, S.S., Stinson, D.R., Wei, W.D.: Some recursive constructions for perfect hash families. J. Combin. Des. 4 (1996) 353-363
20. Blackburn, S.R.: Perfect hash families: Probabilistic methods and explicit constructions. J. of Combin. Theory - Series A 92 (2000) 54-60
21. Blackburn, S.R., Wild, P.R.: Optimal linear perfect hash families. J. Combinatorial Theory 83 (1998) 233-250
22. Fredman, M.L., Komlos, J.: On the size of separating systems and families of perfect hash functions. SIAM J. Alg. Discrete Methods 5 (1984) 61-68
23. Korner, J., Marton: New bounds for perfect hashing via information theory. European J. Combin. 9 (1988) 523-530
24. Stinson, D.R., Wei, R., Zhu, L.: New constructions for perfect hash families and related structures using combinatorial designs and codes. J. of Combinatorial Designs 8 (2000) 189-200
25. Czech, Z.J., Havas, G., Majewski, B.S.: Perfect hashing. Theoretical Computer Science 182 (1997) 1-143
26. Shamir, A.: How to share a secret. CACM 22 (1979) 612-613
27. Slot, C., van Emde Boas, P.: On tape versus core; an application of space efficient perfect hash functions to the invariance of space. In: 16thSTOC. (1984) 391-400
28. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)
29. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. SIAM 8 (1960) 300-304
30. Macwilliams, F.R., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Mathematical library. North-Holland (1978)