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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

A brief review on quantum bit commitment

Álvaro J. Almeida, Ricardo Loura, Nikola Paunković, Nuno A. Silva, Nelson Jesus Muga, Paulo Mateus, Paulo Sérgio de Brito André, Armando N. Pinto

Published Aug 22, 2014• 8 citations
Publisher

Abstract

In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.

DOI
10.1117/12.2063733

Related papers

Quantum bit commitment protocol without quantum memory

Rubens Viana Ramos, Fábio Alencar Mendonça

Quantum protocols for bit commitment have been proposed and it is largely accepted that unconditionally secure quantum bit commitment is not possible; however, it can be more secure than classical bit commitment. In despite of its usefulness, quantum bit commitment protocols have not been experimentally implemented. The main reason is the fact that all proposed quantum bit commitment protocols require quantum memory. In this work, we show a quantum bit commitment protocol that does not require quantum memory and can be implemented with present technology.

arXiv:0801.0690•Jan 4, 2008•3 citations

A feasible and practically secure quantum bit commitment protocol

Li Li, Runhua Shi

As a fundamental cryptographic primitive, bit commitment has lots of important and practical applications in modern cryptography. All previously proposed non-relativistic quantum bit commitment protocols cannot evade the Lo–Chau and Mayers attacks. Furthermore, relativistic quantum bit commitment protocols require rigorous spacetime constraints. In this paper, we present a simple, feasible but practically secure quantum bit commitment protocol without any spacetime constraint. The security of the proposed protocol is based on non-relativistic quantum mechanics, but it can resist all known attacks, including the Lo–Chau and Mayers attacks in practice.

Modern Physics Letters A•Nov 10, 2021•3 citations

A brief review on the impossibility of quantum bit commitment

Gilles Brassard A, Claude Crépeau, Dominic Mayers +1 more

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit commitment which focuses on the general impossibility theorem and on recent attempts to bypass this result is provided.

arXiv:quant-ph/9712023•Dec 10, 1997•25 citations

A novel single agent quantum bit commitment scheme

Linxi Zhang, Nan Zhao, Changxing Pei +1 more

Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.

2012 International Conference on Computing, Networking and Communications (ICNC)•Jan 1, 2017•0 citations

A novel single agent quantum bit commitment scheme

Zhang Linxi, Nan Zhao, Changxing Pei +1 more

Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.

IEEE Conference Proceedings•Jan 1, 2017•0 citations

Standard quantum bit commitment - an indefinite commitment time.

Muhammad Nadeem

Currently, it is believed in the literature that unconditionally secure bit commitment is impossible in non-relativistic quantum cryptography while only a weaker notion of bit commitment with finite commitment time is achievable in relativistic quantum setting. Moreover, relativistic classical bit commitment protocols allow arbitrary long commitment time but such protocols are not practically feasible; either because of multiple rounds of communication that result in exponential increase in communication complexity or due to asymptotic nature of security argument. The impossibility of practically feasible standard bit commitment leaves an obvious skepticism on the completeness of Hilbert space quantum cryptography and its claims of unconditional security. Contrary to the previously proposed results, we demonstrate here that an information-theoretic standard bit commitment scheme can be devised by using rules of purely non-relativistic quantum mechanics only; neither additional resources from theory of relativity nor multiple rounds of communications are required. The proposed bit commitment scheme can be applied efficiently with existing quantum technologies without long term quantum memory; quantum entanglement is required only for time t+δ where t is the communication time between the committer and receiver while δ << t is the processing time at laboratory.

•Jan 1, 2016•0 citations
In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.
Quantum protocols for bit commitment have been proposed and it is largely accepted that unconditionally secure quantum bit commitment is not possible; however, it can be more secure than classical bit commitment. In despite of its usefulness, quantum bit commitment protocols have not been experimentally implemented. The main reason is the fact that all proposed quantum bit commitment protocols require quantum memory. In this work, we show a quantum bit commitment protocol that does not require quantum memory and can be implemented with present technology.
As a fundamental cryptographic primitive, bit commitment has lots of important and practical applications in modern cryptography. All previously proposed non-relativistic quantum bit commitment protocols cannot evade the Lo–Chau and Mayers attacks. Furthermore, relativistic quantum bit commitment protocols require rigorous spacetime constraints. In this paper, we present a simple, feasible but practically secure quantum bit commitment protocol without any spacetime constraint. The security of the proposed protocol is based on non-relativistic quantum mechanics, but it can resist all known attacks, including the Lo–Chau and Mayers attacks in practice.
The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit commitment which focuses on the general impossibility theorem and on recent attempts to bypass this result is provided.
Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.
Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.
Currently, it is believed in the literature that unconditionally secure bit commitment is impossible in non-relativistic quantum cryptography while only a weaker notion of bit commitment with finite commitment time is achievable in relativistic quantum setting. Moreover, relativistic classical bit commitment protocols allow arbitrary long commitment time but such protocols are not practically feasible; either because of multiple rounds of communication that result in exponential increase in communication complexity or due to asymptotic nature of security argument. The impossibility of practically feasible standard bit commitment leaves an obvious skepticism on the completeness of Hilbert space quantum cryptography and its claims of unconditional security. Contrary to the previously proposed results, we demonstrate here that an information-theoretic standard bit commitment scheme can be devised by using rules of purely non-relativistic quantum mechanics only; neither additional resources from theory of relativity nor multiple rounds of communications are required. The proposed bit commitment scheme can be applied efficiently with existing quantum technologies without long term quantum memory; quantum entanglement is required only for time t+δ where t is the communication time between the committer and receiver while δ << t is the processing time at laboratory.