The Trouble with Quantum Bit Commitment
arXiv:quant-ph/9603015
Abstract
In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Crépeau, Jozsa and Langlois (BCJL). The intuition behind their attack is correct, and indeed they expose a weakness common to all proposals of a certain kind, but the BCJL protocol does not fall in this category. Nevertheless, it is true that the BCJL protocol is insecure, but the required attack and proof are more subtle. Here we provide the first complete proof that the BCJL protocol is insecure.
12 pages in revtex (preprint). This revised version contains one minor algebraic modification
References in corpus (1)
Cited by in corpus (30)
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Insecurity of Quantum Secure Computations
- Multi-particle entanglement and its applications to cryptography
- Unconditional security from noisy quantum storage
- The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Unconditionally Secure Bit Commitment with Flying Qudits
- Brief History of Quantum Cryptography: A Personal Perspective
- Entanglement Cost of Quantum Channels
- Implications of Superstrong Nonlocality for Cryptography
- The quantum bit commitment theorem
- Location-Oblivious Data Transfer with Flying Entangled Qudits
- A brief review on the impossibility of quantum bit commitment
- Defeating classical bit commitments with a quantum computer
- Multi-party Quantum Computation
- Unconditionally Secure Quantum Coin Tossing
- Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
- Cryptography in a Quantum World
- The Conal representation of Quantum States and Non Trace-Preserving Quantum Operations
- Categorical composable cryptography
- Superselection Rules in Quantum Cryptography
- Categorical composable cryptography: extended version
- Robust Cryptography in the Noisy-Quantum-Storage Model
- Quantum information processing and quantum logic: toward mutual illumination
- Secure Classical Bit Commitment using Fixed Capacity Communication Channels
- Rigidity for Monogamy-of-Entanglement Games
- Counterfactual Quantum Bit Commitment
- Quantum Bit Commitment Protocol Based on Counterfactual Quantum Cryptography
- Practical quantum oblivious transfer and bit commitment protocols