arXiv Analytics

Sign in

arXiv:quant-ph/0109055AbstractReferencesReviewsResources

How unconditionally secure quantum bit commitment is possible

H. P. Yuen

Published 2001-09-13, updated 2001-11-20Version 2

Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. In this paper, the scope of this general impossibility proof is analyzed, and gaps are found. Two variants of a bit commitment scheme utilizing anonymous quantum states and decoy states are presented. In the first variant, the exact verifying measurement is independent of the committed bit value, thus the second party can make it before the first party opens, making possible an unconditional security proof based on no-cloning. In the second variant, the impossibility proof fails because quantum entanglement purification of a mixed state does not render the protocol determinate. Whether impossibility holds in this or similar protocols is an open question, although preliminary results already show that the impossibility proof cannot work as it stands.

Comments: 36 pages; made a few clarifications and elaborations in this revision
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0006109 (Published 2000-06-23, updated 2000-10-18)
Unconditionally Secure Quantum Bit Commitment Is Possible
arXiv:quant-ph/0505132 (Published 2005-05-18)
Unconditionally Secure Quantum Bit Commitment
arXiv:1709.01396 [quant-ph] (Published 2017-09-01)
Unconditionally secure quantum bit commitment using infinite-dimensional systems