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

arXiv:0901.1643

Perfect Secure High-Dimensional Quantum Bit Commitment Protocol

Chunyan Li, Siyu Song, Wanying Wang, Long, Gui Lu

Published Jan 12, 2009• 0 citations
arXivHTMLPDF

Abstract

This paper has been withdrawn due to security loophole. We thank Dr G. P. he for pointing this to us.
DOI
10.48550/arxiv.0901.1643

Related papers

The existance of unconditionally secure quantum bit commitment

Chuan‐Feng Li, Guang‐Can Guo

This paper has been withdrawn by the author(s).The scheme presented is insecure.

arXiv:quant-ph/0106002•Jun 1, 2001•0 citations

On the Possibility of Unconditionally Secure Quantum Bit Commitment

Chi-Yee Cheung

This paper has been withdrawn by the author.

arXiv:quant-ph/9909048•Sep 15, 1999•1 citation

Unconditionally Secure Quantum Bit Commitment

Adrian Kent

This paper has been withdrawn: it does not evade the no-go results of Mayers, Lo and Chau, to whom I am most grateful for helpful correspondences.

arXiv:quant-ph/9711023•Nov 17, 1997•1 citation

An Unconditionally Secure Quantum Bit Commitment Scheme

Xin Lü, Zhi Ma, Dengguo Feng

This paper has been withdrawn by the authors,because the proposed protocol is still coverd by the no-go theorem of Mayers, Lo and Chau. We thank H-K. Lo and HF Chau for helpful correspondences.

arXiv:quant-ph/0403036•Mar 4, 2004•2 citations

Permanently Secure Quantum Bit Commitment from a Temporary Computation Bound

Adrian Kent

This paper has been withdrawn. See quant-ph/9806031 for a discussion.

arXiv:quant-ph/9712002•Dec 1, 1997•0 citations

Honest-binding quantum bit commitment from separable operations

Ziad Chaoui, Anna Pappa, Matteo Rosati

Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both classical and quantum, is impossible. In this work, we demonstrate that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit-commitment schemes. Specifically, we prove that in any perfectly hiding bit-commitment protocol, an honestly committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment. To illustrate our findings, we present an example protocol.

arXiv:2501.07351•Physical Review A•May 5, 2026•1 citation
Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both classical and quantum, is impossible. In this work, we demonstrate that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit-commitment schemes. Specifically, we prove that in any perfectly hiding bit-commitment protocol, an honestly committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment. To illustrate our findings, we present an example protocol.