Quantum coin tossing and bit-string generation in the presence of noise
arXiv:quant-ph/0303182 · doi:10.1103/PhysRevA.69.022322
Abstract
We discuss the security implications of noise for quantum coin tossing protocols. We find that if quantum error correction can be used, so that noise levels can be made arbitrarily small, then reasonable security conditions for coin tossing can be framed so that results from the noiseless case will continue to hold. If, however, error correction is not available (as is the case with present day technology), and significant noise is present, then tossing a single coin becomes problematic. In this case, we are led to consider random n-bit string generation in the presence of noise, rather than single-shot coin tossing. We introduce precise security criteria for n-bit string generation and describe an explicit protocol that could be implemented with present day technology. In general, a cheater can exploit noise in order to bias coins to their advantage. We derive explicit upper bounds on the average bias achievable by a cheater for given noise levels.
REVTeX. 6 pages, no figures. Early versions contained errors in statements of security conditions, although results were correct. v4: PRA version
References in corpus (2)
Cited by in corpus (13)
- Experimental Quantum Coin Tossing
- Experimental plug&play quantum coin flipping
- Flipping quantum coins
- Fair Loss-Tolerant Quantum Coin Flipping
- Experimental quantum tossing of a single coin
- Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
- Provably Secure Experimental Quantum Bit-String Generation
- Practical Quantum Coin Flipping
- Security of Quantum Bit-String Generation
- Measurement-Device-Independent Quantum Coin Tossing
- A family of loss-tolerant quantum coin flipping protocols
- Unconditionally secure relativistic multi-party biased coin flipping and die rolling
- Semi-Loss-Tolerant Strong Coin Flipping Protocol Using EPR Pairs