On robust combiners for private information retrieval and other primitives

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

Volumn 4117 LNCS, Issue , 2006, Pages 555-569

  Meier, Remo ^a   Przydatek, Bartosz ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Bit commitment; Cryptographic primitives; Oblivious transfer; Private information retrieval; Reductions; Robust combiners

Indexed keywords

CRYPTOGRAPHY; DATA TRANSFER; INFORMATION THEORY; ROBUSTNESS (CONTROL SYSTEMS); SECURITY OF DATA; THEOREM PROVING;

BIT COMMITMENT; OBLIVIOUS TRANSFER; PRIVATE INFORMATION RETRIEVAL; ROBUST COMBINERS;

INFORMATION RETRIEVAL SYSTEMS;

EID: 33749557902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_33     Document Type: Conference Paper

References (27)

1. [AB81] C. A. Asmuth and G. R. Blakely. An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems. Computers and Mathematics with Applications, 7:447-450, 1981.
2. [BIKM99] A. Beimel, Y. Ishai, E. Kushilevitz, and T. Malkin. One-way functions are essential for single-server private information retrieval. In Proc. ACM STOC, pages 89-98, 1999.
3. [BKY03] D. Bleichenbacher, A. Kiayias, and M. Yung. Decoding of interleaved Reed-Solomon codes over noisy data. In Proc. ICALP 2003, pages 97-108, 2003.
4. [Cha04] Y.-C. Chang. Single database private information retrieval with logarithmic communication. In Proc. Information Security and Privacy: 9th Australasian Conference, ACISP 2004, pages 50-61, 2004.
5. [CK88] C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions (extended abstract). In Proc. IEEE FOCS '88, pages 42-52, 1988.
6. [CKGS98] B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. J. ACM, 45(6):965-981, 1998.
7. [CMS99] C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Proc. Eurocrypt '99, pages 402-414, 1999.
8. [Cré87] C. Crépeau. Equivalence between two flavours of oblivious transfers. In Proc. Crypto '87, pages 350-354, 1987.
9. [DIO01] G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Universal service-providers for private information retrieval. Journal of Cryptology, 14(1):37-74, 2001.
10. [DK05] Y. Dodis and J. Katz. Chosen-ciphertext security of multiple encryption. In Proc. TCC '05, pages 188-209, 2005.
11. [DMO00] G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. In Proc. Eurocrypt '00, pages 122-138, 2000.
12. [EG85] S. Even and O. Goldreich. On the power of cascade ciphers. ACM Trans. Comput. Syst., 3(2): 108-116, 1985.
13. [EGL85] S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
14. [Fis02] M. Fischlin. On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function. In Proc. CT-RSA, pages 79-95, 2002.
15. [Gas04] W. I. Gasarch. A survey on private information retrieval (column: Computational complexity). Bulletin of the EATCS, 82:72-107, 2004.
16. [Gol04] O. Goldreich. The Foundations of Cryptography, volume II, Basic Applications. Cambridge University Press, 2004.
17. [Hai04] I. Haitner. Implementing oblivious transfer using collection of dense trapdoor permutations. In Proc. TCC'04, pages 394-409, 2004.
18. [Her05] A. Herzberg. On tolerant cryptographic constructions. In CT-RSA, pages 172-190, 2005. full version on Cryptology ePrint Archive, eprint.iacr.org/2002/135.
19. [HKN+05] D. Harnik, J. Kilian, M. Naor, O. Reingold, and A. Rosen. On robust combiners for oblivious transfer and other primitives. In Proc. Eurocrypt '05, pages 96-113, 2005.
20. [HL05] S. Hohenberger and A. Lysyanskaya. How to securely outsource cryptographic computations. In Proc. TCC '05, pages 264-282, 2005.
21. [IR89] R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In Proc. ACM STOC, pages 44-61, 1989.
22. [KO97] E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. IEEE FOCS '00, pages 364-373, 1997.
23. [KO00] E. Kushilevitz and R. Ostrovsky. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In Proc. Eurocrypt '00, pages 104-121, 2000.
24. [KY01] A. Kiayias and M. Yung. Secure games with polynomial expressions. In Proc. IC ALP 2001, pages 939-950, 2001.
25. [Lip05] H. Lipmaa. An oblivious transfer protocol with log-squared communication. In Proc. Information Security, 8th International Conference, ISC 2005, pages 314-328, 2005.
26. [Nao91] M. Naor. Bit commitment using pseudorandomness. J. Cryptology, 4(2):151-158, 1991.
27. [Rab81] M. O. Rabin. How to exchange secrets by oblivious transfer., 1981. Tech. Memo TR-81, Aiken Computation Laboratory, available at eprint.iacr.org/2005/187.