Why quantum bit commitment and ideal quantum coin tossing are impossible.
From MaRDI portal
Publication:1586916
Abstract: There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy generally requires a quantum computer. We emphasize the generality of this ``no-go theorem: Unconditionally secure bit commitment schemes based on quantum mechanics---fully quantum, classical or quantum but with measurements---are all ruled out by this result. Since bit commitment is a useful primitive for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called ``post-cold-war applications. We also show that ideal quantum coin tossing is impossible because of the EPR attack. This no-go theorem for ideal quantum coin tossing may help to shed some lights on the possibility of non-ideal protocols.
Recommendations
Cites work
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 1263182 (Why is no real title available?)
- scientific article; zbMATH DE number 503241 (Why is no real title available?)
- scientific article; zbMATH DE number 1030986 (Why is no real title available?)
- Error Correcting Codes in Quantum Theory
- Experimental quantum cryptography.
- Fidelity for Mixed Quantum States
- Mathematical techniques for quantum communication theory
- Quantum cryptography based on Bell’s theorem
- Quantum key distribution and string oblivious transfer in noisy channels
Cited in
(37)- On local realism and commutativity
- Weak coin flipping with small bias
- Quantum bit escrow
- A new protocol and lower bounds for quantum coin flipping
- QUANTUM BIT COMMITMENT WITH SECRET PARAMETERS
- Infeasibility of quantum cryptography without eavesdropping check
- Cheat-sensitive coin flipping and quantum gambling
- A broader view on the limitations of information processing and communication by nature
- Quantum entanglement
- Quantum Gambling
- Dilemma that cannot be resolved by biased quantum coin flipping
- Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol
- Security of quantum bit string commitment depends on the information measure
- On the round complexity of secure quantum computation
- On the impossibility of non-static quantum bit commitment between two parties
- General properties of quantum bit commitments (extended abstract)
- Device-independent bit commitment based on the CHSH inequality
- Unconditionally secure quantum bit commitment based on the uncertainty principle
- Resource requirements of private quantum channels and consequences for oblivious remote state preparation
- A short impossibility proof of quantum bit commitment
- The Unruh-DeWitt model and its joint interacting Hilbert space
- Quantum dice rolling: a multi-outcome generalization of quantum coin flipping
- Quantum state targeting
- Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol
- Remote preparation of arbitrary ensembles and quantum bit commitment
- New binding-concealing trade-offs for quantum string commitment
- Quantum communication protocols using the vacuum
- Cryptanalysis and improvement of ``Game theoretic security of quantum bit commitment
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- On the question of secret probability distributions in quantum bit commitment
- Implications of superstrong non-locality for cryptography
- A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice?
- Fidelity of quantum strategies with applications to cryptography
- Basing cryptographic protocols on tamper-evident seals
- QUANTUM AUTHENTICATION USING ENTANGLED STATES
- Probabilistic versions of quantum private queries
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES
This page was built for publication: Why quantum bit commitment and ideal quantum coin tossing are impossible.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586916)
