Robuster combiners for oblivious transfer

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

Volumn 4392 LNCS, Issue , 2007, Pages 404-418

  Meier, Remo ^a   Przydatek, Bartosz ^a   Wullschleger, Jürg ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Oblivious transfer; Robust combiners; Weak oblivious transfer

Indexed keywords

CRYPTOGRAPHY; NETWORK PROTOCOLS; ROBUSTNESS (CONTROL SYSTEMS);

OBLIVIOUS TRANSFER; ROBUST COMBINERS; WEAK OBLIVIOUS TRANSFER;

SECURITY OF DATA;

EID: 38049022468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_22     Document Type: Conference Paper

References (24)

1. Charles A. Asmuth and George R. Blakely. An effcient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems. Computers and Mathematics with Applications, 7:447-450, 1981.
2. Dan Boneh and Xavier Boyen. On the impossibility of efficiently combining collision resistant hash functions. In Proc. CRYPTO '06, pages 570-583, August 2006.
3. Gilles Brassard, Claude Crépeau, and Stefan Wolf. Oblivious transfers and privacy amplification. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 16(4):219-237, 2003.
4. George R. Blakley. Safeguarding cryptographic keys. In Proceedings of the National Computer Conference, pages 313-317. American Federation of Information Processing Societies, 1979.
5. Manuel Blum. Coin flipping by telephone - a protocol for solving impossible problems. In COMPCON, Proc. Twenty-Fourth IEEE Computer Society International Conference, pages 133-137, 1982.
6. Christian Cachin. On the foundations of oblivious transfer. In Proc. EUROCRYPT'98, pages 361-374, May 1998.
7. Claude Crépeau and Joe Kilian. Achieving oblivious transfer using weak-ened security assumptions (extended abstract). In Proc. IEEE FOCS '88, pages 42-52, 1988.
8. Claude Crépeau. Equivalence between two flavours of oblivious transfers. In Proc. CRYPTO '87, pages 350-354, 1987.
9. Claude Crépeau and Miklós Sántha. On the reversibility of oblivious transfer. In Proc. EUROCRYPT '91, volume 547, pages 106-113, 1991.
10. Ivan Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner. Oblivious transfer and linear functions. In Proc. CRYPTO '06, pages 427-444, August 2006.
11. Yevgeniy Dodis and Jonathan Katz. Chosen-ciphertext security of multiple encryption. In Proc. TCC '05, pages 188-209, 2005.
12. Ivan Damgård, Joe Kilian, and Louis Salvail. On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In Proc. EUROCRYPT '99, pages 56-73, 1999.
13. Shimon Even and Oded Goldreich. On the power of cascade ciphers. ACM Trans. Comput. Syst., 3(2):108-116, 1985.
14. Shimon Even, Oded Goldreich, and Abraham Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
15. Amir Herzberg. On tolerant cryptographic constructions. In CT-RSA, pages 172-190, 2005. full version on Cryptology ePrint Archive, eprint.iacr.org/2002/135.
16. Danny Harnik, Joe Kilian, Moni Naor, Orner Reingold, and Alon Rosen. On robust combiners for oblivious transfer and other primitives. In Proc. EUROCRYPT '05, pages 96-113, 2005.
17. Susan Hohenberger and Anna Lysyanskaya. How to securely outsource cryptographic computations. In Proc. TCC '05, pages 264-282, 2005.
18. Ueli Maurer and James L. Massey. Cascade ciphers: The importance of being first. Journal of Cryptology, 6(1):55-61, 1993. preliminary version in Proc. IEEE Symposium on Information Theory, 1990.
19. Remo Meier and Bartosz Przydatek. On robust combiners for private information retrieval and other primitives. In Proc. CRYPTO '06, pages 555-569, August 2006.
20. Rafail Ostrovsky, Ramarathnam Venkatesan, and Moti Yung. Fair games against an all-powerful adversary. In Advances in Computational Complexity Theory, volume 13 of AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 155-169. AMS, 1993.
21. Michael O. Rabin. How to exchange secrets by oblivious transfer., 1981. Tech. Memo TR-81, Aiken Computation Laboratory, available at eprint.iacr.org/2005/187.
22. Adi Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979.
23. Christian Sommer. Robust combiners for cryptographic protocols, 2006. Master Thesis, Computer Science Department, ETH Zurich.
24. Stefan Wolf and Jürg Wullschleger. Oblivious transfer is symmetric. In Proc. EUROCRYPT '06, pages 222-232, 2006.