Abstract
We consider the cryptographic two-party protocol task of extending a given coin toss. The goal is to generate n common random coins from a single use of an ideal functionality which gives m < n common random coins to the parties. In the framework of Universal Composability we show the impossibility of securely extending a coin toss for statistical and perfect security. On the other hand, for computational security the existence of a protocol for coin toss extension depends on the number m of random coins which can be obtained “for free”.
For the case of stand-alone security, i.e., a simulation based security definition without an environment, we present a novel protocol for unconditionally secure coin toss extension. The new protocol works for superlogarithmic m, which is optimal as we show the impossibility of statistically secure coin toss extension for smaller m.
Combining our results with already known results, we obtain a (nearly) complete characterization under which circumstances coin toss extension is possible.
Keywords
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-540-34547-3_36
Download to read the full chapter text
Chapter PDF
References
Ambanis, A., Buhrman, H., Dodis, Y., Röhrig, H.: Multiparty quantum coin flipping. In: 19th Annual IEEE Conference on Computational Complexity, Proceedings of CoCo 2002, pp. 250–259. IEEE Computer Society, Los Alamitos (2004)
Backes, M., Hofheinz, D., Müller-Quade, J., Unruh, D.: On fairness in simulatability-based cryptographic systems. In: 3rd ACM Workshop on Formal Methods in Security Engineering, Proceedings of FMSE 2005, pp. 13–22. ACM Press, New York (2005)
Backes, M., Pfitzmann, B., Waidner, M.: Secure asynchronous reactive systems. IACR ePrint Archive (March 2004)
Bellare, M., Garay, J.A., Rabin, T.: 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, pp. 191–200. ACM Press, New York (1996)
Blum, M.: Coin flipping by telephone. In: Gersho, A (ed.) Advances in Cryptology, A report on CRYPTO 1981, number 82-04 in ECE Report, University of California, Electrical and Computer Engineering, pp. 11–15 (1982)
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136–145. IEEE Computer Society, Los Alamitos (2001)
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136–145. IEEE Computer Society, Los Alamitos (2001)
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint Archive (January 2005), Full and revised version of [7]
Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19–40. Springer, Heidelberg (2001)
Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pp. 494–503. ACM Press, New York (2002) (extended abstract)
Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences 18(2), 143–154 (1979)
Cleve, R.: 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, pp. 364–369. ACM Press, New York (1986)
Goldreich, O.: Foundations of Cryptography (Basic Applications), vol. 2. Cambridge University Press, Cambridge (2004)
Hofheinz, D., Müller-Quade, J., Unruh, D.: On the (im-)possibility of extending coin toss. IACR ePrint Archive, Full version of this paper (2006)
Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989, pp. 12–24. ACM Press, New York (1989) (extended abstract)
Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Security and Privacy, Proceedings of SSP 2001, pp. 184–200. IEEE Computer Society, Los Alamitos (2001)
Stinson, D.R.: 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hofheinz, D., Müller-Quade, J., Unruh, D. (2006). On the (Im-)Possibility of Extending Coin Toss. In: Vaudenay, S. (eds) Advances in Cryptology - EUROCRYPT 2006. EUROCRYPT 2006. Lecture Notes in Computer Science, vol 4004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11761679_30
Download citation
DOI: https://doi.org/10.1007/11761679_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34546-6
Online ISBN: 978-3-540-34547-3
eBook Packages: Computer ScienceComputer Science (R0)