A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction

Abstract

We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared information, and achieves computational concealing and statistical binding under a natural complexity-theoretical… (More)

Topics

Cite this paper

@article{Yamakami2013ANQ, title={A Non-Interactive Quantum Bit Commitment Scheme that Exploits the Computational Hardness of Quantum State Distinction}, author={Tomoyuki Yamakami}, journal={CoRR}, year={2013}, volume={abs/1309.0436} }