Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Unconditionally Secure Quantum Bit Commitment Protocol

최정운

Published Jan 1, 2009• 0 citations
OpenAlex

Related papers

Unconditionally Secure Quantum Bit Commitment Protocol Based on Incomplete Information

Naya Nagy, Marius Nagy

Lecture notes in computer science•Jan 1, 2014•3 citations

Another simple unconditionally secure quantum bit commitment protocol -- the use of bit-value dependent evidence state space

Horace P. Yuen

•May 23, 2003•0 citations

Unconditionally secure quantum bit commitment: Revised.

M. X. Luo, Xiaojun Wang

•Jan 1, 2020•1 citation

Impossibility of unconditionally secure commitment of a certified classical bit

Adrian Kent

In a secure bit commitment protocol involving only classical physics, A commits either a $0$ or a $1$ to B. If quantum information is used in the protocol, A may be able to commit a state of the form $\ensuremath{\alpha}|0〉+\ensuremath{\beta}|1〉.$ If so, she can also commit mixed states in which the committed bit is entangled with other quantum states under her control. We introduce here a quantum cryptographic primitive, bit commitment with a certificate of classicality (BCCC), which differs from standard bit commitment in that it guarantees that the committed state has a fixed classical value. We show that no unconditionally secure BCCC protocol based on special relativity and quantum theory exists. We also propose complete definitions of security for quantum and relativistic bit commitment.

arXiv:quant-ph/9910087•Physical Review A•Mar 2, 2000•25 citations

Practical quantum bit commitment protocol

Ariel Danan, Lev Vaidman A

arXiv:1202.3331•Quantum Information Processing•Aug 31, 2011•25 citations

Quantum bit commitment and unconditional security

Horace P. Yuen

It is generally believed that unconditionally secure quantum bit commitment is impossible, due to widespread acceptance of an impossibility proof that utilizes quantum entaglement cheating. In this paper, we delineate how the impossibiliy proof formulation misses various types of quantum bit commitment protocols based on two-way quantum communications. We point out some of the gaps in the impossibility proof reasoning, and present corresponding counterexamples. Four different types of bit commitment protocols are constructed with several new protocol techniques. A specific Type 4 protocol is described and proved unconditionally secure. Security analysis of a Type 1 protocol and a Type 2 protocol are also sketched. The security of Type 3 protocols is as yet open. A development of quantum statistical decision theory and quantum games is needed to provie a complete security analysis of many such protocols.

arXiv:quant-ph/0207089•Jul 16, 2002•14 citations
In a secure bit commitment protocol involving only classical physics, A commits either a 000 or a 111 to B. If quantum information is used in the protocol, A may be able to commit a state of the form $\ensuremath{\alpha}|0〉+\ensuremath{\beta}|1〉.$ If so, she can also commit mixed states in which the committed bit is entangled with other quantum states under her control. We introduce here a quantum cryptographic primitive, bit commitment with a certificate of classicality (BCCC), which differs from standard bit commitment in that it guarantees that the committed state has a fixed classical value. We show that no unconditionally secure BCCC protocol based on special relativity and quantum theory exists. We also propose complete definitions of security for quantum and relativistic bit commitment.
It is generally believed that unconditionally secure quantum bit commitment is impossible, due to widespread acceptance of an impossibility proof that utilizes quantum entaglement cheating. In this paper, we delineate how the impossibiliy proof formulation misses various types of quantum bit commitment protocols based on two-way quantum communications. We point out some of the gaps in the impossibility proof reasoning, and present corresponding counterexamples. Four different types of bit commitment protocols are constructed with several new protocol techniques. A specific Type 4 protocol is described and proved unconditionally secure. Security analysis of a Type 1 protocol and a Type 2 protocol are also sketched. The security of Type 3 protocols is as yet open. A development of quantum statistical decision theory and quantum games is needed to provie a complete security analysis of many such protocols.