Quantum bit escrow
From MaRDI portal
Abstract: Unconditionally secure bit commitment and coin flipping are known to be impossible in the classical world. Bit commitment is known to be impossible also in the quantum world. We introduce a related new primitive - {em quantum bit escrow}. In this primitive Alice commits to a bit to Bob. The commitment is {em binding} in the sense that if Alice is asked to reveal the bit, Alice can not bias her commitment without having a good probability of being detected cheating. The commitment is {em sealing} in the sense that if Bob learns information about the encoded bit, then if later on he is asked to prove he was playing honestly, he is detected cheating with a good probability. Rigorously proving the correctness of quantum cryptographic protocols has proved to be a difficult task. We develop techniques to prove quantitative statements about the binding and sealing properties of the quantum bit escrow protocol. A related primitive we construct is a quantum biased coin flipping protocol where no player can control the game, i.e., even an all-powerful cheating player must lose with some constant probability, which stands in sharp contrast to the classical world where such protocols are impossible.
Recommendations
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
- scientific article; zbMATH DE number 1302858
- Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- scientific article; zbMATH DE number 1283995
Cited in
(33)- Quantum coin hedging, and a counter measure
- A search for quantum coin-flipping protocols using optimization techniques
- Cryptanalysis and improvement of ``Game theoretic security of quantum bit commitment
- Unconditionally secure relativistic multi-party biased coin flipping and die rolling
- Quantum games: a review of the history, current state, and interpretation
- High-capacity measurement-device-independent deterministic secure quantum communication
- Weak coin flipping with small bias
- A sample-driven solving procedure for the repeated reachability of quantum continuous-time Markov chains
- Basing cryptographic protocols on tamper-evident seals
- Cryptanalysis and improvement of the semi-quantum secret sharing protocol
- Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
- Two-way quantum-bit-string commitment
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
- An optimally fair coin toss
- Bitcoin Crypto–Bounties for Quantum Capable Adversaries
- New binding-concealing trade-offs for quantum string commitment
- A quantum game designed for property partitioning with implementation on superconducting quantum processors
- Cheat-sensitive coin flipping and quantum gambling
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES
- Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement
- Transferable quantum cheque scheme based on quantum public-key cryptography
- An entanglement-based protocol for strong coin tossing with bias \(1/4\)
- A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias
- QUANTUM BIT STRING SEALING
- Fair coin flipping: tighter analysis and the many-party case
- Quantum cryptography beyond quantum key distribution
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- A new protocol and lower bounds for quantum coin flipping
- Susceptible Two-Party Quantum Computations
- Quantum leader election
- Fully simulatable quantum-secure coin-flipping and applications
- Quantum cryptography: key distribution and beyond
- Detector-device-independent quantum key agreement based on single-photon Bell state measurement
This page was built for publication: Quantum bit escrow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192045)
