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

Journal of Experimental and Theoretical Physics Letters

Quantum bit commitment in a channel with noise

S. N. Molotkov, S. S. Nazin

Published Jan 1, 2001• 0 citations
Publisher

Abstract

Under rather general assumptions about the properties of a quantum channel with noise, a quantum protocol providing implementation of secret bit commitment with the probability as close to unity as is wished is proposed.
DOI
10.1134/1.1358431

Related papers

Quantum Bit Commitment in a Noisy Channel

S. N. Molotkov, S. S. Nazin

Under rather general assumptions about the properties of a noisy quantum channel, a first quantum protocol is proposed which allows to implement the secret bit commitment with the probability arbitrarily close to unity.

arXiv:quant-ph/0101105•Jan 22, 2001•0 citations

A simple practical quantum bit commitment protocol

muqian wen

This paper devises a simple quantum bit commitment protocol that is just as easy to implement as any existing practical quantum bit commitment protocols but will be more secure. It will be infinitely close to being unconditionally fully secure although neither perfectly binding nor perfectly concealing.

arXiv:2009.13263•Sep 25, 2020•0 citations

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 brief review on quantum bit commitment

Álvaro J. Almeida, Ricardo Loura, Nikola Paunković +5 more

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.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 22, 2014•8 citations

Relativistic quantum bit commitment in real-time

S. N. Molotkov, S. S. Nazin

A relativistic quantum exchange protocol making it possible to implement a bit commitment scheme is realized. The protocol is based on the idea that in the relativistic case the propagation of a field into a region of space accessible for measurement requires, in contrast to the nonrelativistic case, a finite time that depends on the structure of the states. The protocol requires one classical and several quantum communication channels. It turns out that it is possible in principle to preserve the secret bit for as long a period of time desired and with probability as close to 1 as desired.

Journal of Experimental and Theoretical Physics•Apr 1, 2000•1 citation

Simple, Near-Optimal Quantum Protocols for Die-Rolling

Jamie Sikora

Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random D-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal of Physics, 2010) but are based on optimal weak coin-flipping protocols that are currently very complicated and not very well understood. In this paper, we first present very simple classical protocols for die-rolling that have decent (and sometimes optimal) security, which is in stark contrast to coin-flipping, bit-commitment, oblivious transfer, and many other two-party cryptographic primitives. We also present quantum protocols based on the idea of integer-commitment, a generalization of bit-commitment, where one wishes to commit to an integer. We analyze these protocols using semidefinite programming and finally give protocols that are very close to Kitaev’s lower bound for any D ≥ 3 . Lastly, we briefly discuss an application of this work to the quantum state discrimination problem.

arXiv:1605.08156•Cryptography•Jul 8, 2017•8 citations
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.
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.
A relativistic quantum exchange protocol making it possible to implement a bit commitment scheme is realized. The protocol is based on the idea that in the relativistic case the propagation of a field into a region of space accessible for measurement requires, in contrast to the nonrelativistic case, a finite time that depends on the structure of the states. The protocol requires one classical and several quantum communication channels. It turns out that it is possible in principle to preserve the secret bit for as long a period of time desired and with probability as close to 1 as desired.
Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random D-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal of Physics, 2010) but are based on optimal weak coin-flipping protocols that are currently very complicated and not very well understood. In this paper, we first present very simple classical protocols for die-rolling that have decent (and sometimes optimal) security, which is in stark contrast to coin-flipping, bit-commitment, oblivious transfer, and many other two-party cryptographic primitives. We also present quantum protocols based on the idea of integer-commitment, a generalization of bit-commitment, where one wishes to commit to an integer. We analyze these protocols using semidefinite programming and finally give protocols that are very close to Kitaev’s lower bound for any D ≥ 3 . Lastly, we briefly discuss an application of this work to the quantum state discrimination problem.