Abstract
Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a tight bound on the range of implementable unconditionally secure coin flips, both in the classical as well as in the quantum setting and for both weak as well as strong coin flipping. But the picture is still incomplete: in the quantum setting, all results consider only protocols with perfect correctness, and in the classical setting tight bounds for strong coin flipping are still missing.
We give a general definition of coin flipping which unifies the notion of strong and weak coin flipping (it contains both of them as special cases) and allows the honest players to abort with a certain probability. We give tight bounds on the achievable range of parameters both in the classical and in the quantum setting.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aharonov, D., Ta-Shma, A., Vazirani, U.V., Yao, A.C.: Quantum bit escrow. In: STOC 2000: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 705–714 (2000)
Ambainis, A.: A new protocol and lower bounds for quantum coin flipping. In: STOC 2001: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 134–142 (2001)
Ambainis, A., Buhrman, H., Dodis, Y., Röhrig, H.: Multiparty quantum coin flipping. In: CCC 2004: Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pp. 250–259 (2004)
Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238–257. Springer, Heidelberg (2004)
Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23–27 (1983)
Chailloux, A., Kerenidis, I.: Optimal quantum strong coin flipping. In: FOCS 2009: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 527–533 (2009)
Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC 1986: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 364–369 (1986)
Colbeck, R.: An entanglement-based protocol for strong coin tossing with bias 1/4. Physics Letters A 362(5-6), 390–392 (2007)
Hofheinz, D., Müller-Quade, J., Unruh, D.: On the (Im-)Possibility of extending coin toss. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 504–521. Springer, Heidelberg (2006)
Kerenidis, I., Nayak, A.: Weak coin flipping with small bias. Information Processing Letters 89(3), 131–135 (2004)
Kitaev, A.: Quantum coin-flipping. In: QIP 2003 (2002), Slides http://www.msri.org/publications/ln/msri/2002/qip/kitaev/1/index.html
Lo, H.-K., Chau, H.F.: Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica D 120(1-2), 177–187 (1998)
Mochon, C.: Quantum weak coin-flipping with bias of 0.192. In: FOCS 2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 2–11 (2004)
Mochon, C.: Serial composition of quantum coin flipping and bounds on cheat detection for bit commitment. Physical Review A 70(3), 32312 (2004)
Mochon, C.: Quantum weak coin flipping with arbitrarily small bias (2007), http://arxiv.org/abs/0711.4114
Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1–18. Springer, Heidelberg (2009)
Nguyen, A.T., Frison, J., Huy, K.P., Massar, S.: Experimental quantum tossing of a single coin. New Journal of Physics 10(8), 83037 (2008)
Spekkens, R.W., Rudolph, T.: Degrees of concealment and bindingness in quantum bit commitment protocols. Physical Review A 65(1), 12310 (2001)
Spekkens, R.W., Rudolph, T.: A quantum protocol for cheat-sensitive weak coin flipping. Physical Review Letters 89(22), 227901 (2002)
Winkler, S., Wullschleger, J.: On the efficiency of classical and quantum oblivious transfer reductions. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 707–723. Springer, Heidelberg (2010)
Yao, A.C.: Protocols for secure computations. In: FOCS 1982: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 160–164 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 International Association for Cryptologic Research
About this paper
Cite this paper
Hänggi, E., Wullschleger, J. (2011). Tight Bounds for Classical and Quantum Coin Flipping. In: Ishai, Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19571-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-19571-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19570-9
Online ISBN: 978-3-642-19571-6
eBook Packages: Computer ScienceComputer Science (R0)