Tight bounds for classical and quantum coin flipping
arXiv:1009.4741 · doi:10.1007/978-3-642-19571-6_28
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.
18 pages, 2 figures; v2: published version
References in corpus (6)
- Degrees of concealment and bindingness in quantum bit commitment protocols
- A quantum protocol for cheat-sensitive weak coin flipping
- Quantum weak coin flipping with arbitrarily small bias
- Experimental quantum tossing of a single coin
- An Entanglement-Based Protocol For Strong Coin Tossing With Bias 1/4
- Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment
Cited by in corpus (8)
- Quantum Cryptography Beyond Quantum Key Distribution
- Quantum cryptography: key distribution and beyond
- Experimental plug&play quantum coin flipping
- Flipping quantum coins
- Fully Distrustful Quantum Cryptography
- Single-Photon Advantage in Quantum Cryptography Beyond QKD
- Bit Commitment for Lottery and Auction on Quantum Blockchain
- Experimental cheat-sensitive quantum weak coin flipping