Horace P. Yuen
Published 2005-05-18Version 1
The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that beats entanglement cheating with entanglement is proven to be unconditionally secure.
Comments: 4 pages, no figures; This paper is an expanded, self-contained version of QBC4 presented in quant-ph/0305143. It is the basis of talks to be presented at the University of Pavia, Italy on May 23, 2005 and Nottingham University, England on May 25, 2005
How unconditionally secure quantum bit commitment is possible
Unconditionally secure quantum bit commitment using modified double-slit and unstable particles
Unconditionally secure quantum bit commitment using infinite-dimensional systems
