A brief review on the impossibility of quantum bit commitment

Abstract

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit commitment which focuses on the general impossibility theorem and on recent attempts to bypass this result is provided.

11 pages

References in corpus (4)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• The Trouble with Quantum Bit Commitment
• Quantum Bit Commitment from a Computation Bound

Cited by in corpus (11)

• Information and Computation: Classical and Quantum Aspects
• Reexamination of Quantum Bit Commitment: the Possible and the Impossible
• The quantum bit commitment theorem
• Remote preparation of arbitrary ensembles and quantum bit commitment
• Defeating classical bit commitments with a quantum computer
• Cryptography in a Quantum World
• Long-term secure distributed storage using quantum key distribution network with third-party verification
• Erasable Bit Commitment from Temporary Quantum Trust
• Counterfactual Quantum Bit Commitment
• Quantum Bit Commitment Protocol Based on Counterfactual Quantum Cryptography
• Practical quantum oblivious transfer and bit commitment protocols