Unconditionally secure quantum coin flipping
arXiv:1602.01430 · doi:10.1016/j.rinp.2023.106398
Abstract
Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible. But basing on a problem which cannot be solved without quantum algorithm, here we propose such a QCF protocol, and show how it manages to evade all existing no-go proofs on QCF.
arXiv commentVery close to the published version
References in corpus (15)
- Quantum Cryptography Beyond Quantum Key Distribution
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Cheat Sensitive Quantum Bit Commitment
- A quantum protocol for cheat-sensitive weak coin flipping
- On bit-commitment based quantum coin flipping
- Experimental plug&play quantum coin flipping
- Fully Distrustful Quantum Cryptography
- A large family of quantum weak coin-flipping protocols
- Quantum key distribution based on orthogonal states allows secure quantum bit commitment
- Making An Empty Promise With A Quantum Computer
- Security bound of cheat sensitive quantum bit commitment
- Simplified quantum bit commitment using single photon nonlocality
- Measurement-Device-Independent Quantum Coin Tossing
- Dilemma that cannot be resolved by biased quantum coin flipping
- Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement