Unconditionally Secure Quantum Bit Commitment
classification
🪐 quant-ph
keywords
quantumsecureunconditionallycommitmententanglementaccountbeatsbeen
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.