On the (Im-)possibility of extending coin toss

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

Volumn 4004 LNCS, Issue , 2006, Pages 504-521

  Hofheinz, Dennis ^a   Müller Quade, Jörn ^b   Unruh, Dominique ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Coin toss; Cryptographic protocols; Reactive simulatability; Universal composability

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; NETWORK PROTOCOLS; RANDOM PROCESSES; SECURITY OF DATA;

COIN TOSS; CRYPTOGRAPHIC PROTOCOLS; REACTIVE SIMULATABILITY; UNIVERSAL COMPOSABILITY;

CRYPTOGRAPHY;

EID: 33746043335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_30     Document Type: Conference Paper

References (17)

1. Andris Ambanis, Harry Buhrman, Yevgeniy Dodis, and Heinz Röhrig. Multiparty quantum coin flipping. In 19th Annual IEEE Conference on Computational Complexity, Proceedings of CoCo 2002, pages 250-259. IEEE Computer Society, 2004.
2. Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. On fairness in simulatability-based cryptographic systems. In 3rd ACM Workshop on Formal Methods in Security Engineering, Proceedings of FMSE 2005, pages 13-22. ACM Press, 2005.
3. Michael Backes, Birgit Pfitzmann, and Michael Waidner. Secure asynchronous reactive systems. IACR ePrint Archive, March 2004.
4. Mihir Bellare, Juan A. Garay, and Tal Rabin. Distributed pseudo-random bit generators - a new way to speed-up shared coin tossing. In Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Proceedings of PODC 1996, pages 191-200. ACM Press, 1996.
5. Manuel Blum. Coin flipping by telephone. In Allen Gersho, editor, Advances in Cryptology, A report on CRYPTO 81, number 82-04 in ECE Report, pages 11-15. University of California, Electrical and Computer Engineering, 1982.
6. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pages 136-145. IEEE Computer Society, 2001.
7. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pages 136-145. IEEE Computer Society, 2001.
8. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint Archive, January 2005. Full and revised version of [7].
9. Ran Canetti and Marc Fischlin. Universally composable commitments. In Joe Kilian, editor, Advances in Cryptology, Proceedings of CRYPTO 2001, number 2139 in Lecture Notes in Computer Science, pages 19-40. Springer-Verlag, 2001.
10. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pages 494-503. ACM Press, 2002. Extended abstract.
11. J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, April 1979.
12. Richard Cleve. Limits on the security of coin flips when half the processors are faulty. In Eighteenth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1986, pages 364-369. ACM Press, 1986.
13. Oded Goldreich. Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, May 2004.
14. Dennis Hofheinz, Jörn Müller-Quade, and Dominique Unruh. On the (im-)possibility of extending coin toss. IACR ePrint Archive, 2006. Full version of this paper.
15. Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989, pages 12-24. ACM Press, 1989. Extended abstract.
16. Birgit Pfitzmann and Michael Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy, Proceedings of SSP 2001, pages 184-200. IEEE Computer Society, 2001.
17. Douglas R. Stinson. Universal hash families and the leftover hash lemma, and applications to cryptography and computing. Journal of Combinatorial Mathematics and Combinatorial Computing, 42:3-31, 2002.