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:cs/0503048

Is entanglement necessary to have unconditional security in quantum bit commitment ?

Arindam Mitra

Published Mar 21, 2005• 0 citations
arXivHTMLPDF

Abstract

A simple un-entanglement based quantum bit commitment scheme is presented. Although commitment is unconditionally secure but concealment is not.
DOI
10.48550/arxiv.cs/0503048

Related papers

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

Another simple unconditionally secure quantum bit commitment protocol -- beating entanglement with entanglement

Horace P. Yuen

It is shown how the evidence state space in quantum bit commitment may be made to depend on the bit value 0 or 1 with split entangled pairs. As a consequence, one can obtain a protocol that is perfectly concealing, but is also $ε$-binding because the bit-value dependent evidence space prevents the committing party from cheating by means of a local transformation that is independent of the part of evidence state space that has never been in his possession.

arXiv:quant-ph/0305143•May 23, 2003•0 citations

An Unconditionally Secure Quantum Bit Commitment Protocol

Horace P. Yuen

This article describes a quantum bit commitment protocol, QBC1, based on entanglement destruction via forced measurements and proves its unconditional security.

arXiv:1212.0938•Dec 5, 2012•1 citation

Unconditionally Secure Quantum Bit Commitment is Simply Possible

Arindam Mitra

It has been claimed that unconditionally secure quantum bit commitment is impossible. This claim has been widely accepted and is commonly referred to as the no-go theorem. The no-go theorem implicitly raises the question of whether quantum mechanics can be collectively verified with unconditional security against cheating. We demonstrate that by following an alternative quantum encoding scheme, unconditionally secure quantum bit commitment can, in fact, be achieved.

arXiv:physics/0007089•Jul 28, 2000•1 citation

Unconditionally Secure Quantum Bit Commitment

Horace P. Yuen

The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that beats entanglement cheating with entanglement is proven to be unconditionally secure.

arXiv:quant-ph/0505132•May 18, 2005•6 citations

Unconditional security in quantum bit commitment

Horace P. Yuen

The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found. An unconditionally secure bit commitment protocol utilizing anonymous quantum states and the no-clone theorem is presented below with a full security proof.

arXiv:quant-ph/0106001•Jun 1, 2001•0 citations
It is shown how the evidence state space in quantum bit commitment may be made to depend on the bit value 0 or 1 with split entangled pairs. As a consequence, one can obtain a protocol that is perfectly concealing, but is also εεε-binding because the bit-value dependent evidence space prevents the committing party from cheating by means of a local transformation that is independent of the part of evidence state space that has never been in his possession.
The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found. An unconditionally secure bit commitment protocol utilizing anonymous quantum states and the no-clone theorem is presented below with a full security proof.