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:quant-ph/0009113 · Kluwer Academic Publishers eBooks

Anonymous-Key Quantum Cryptography and Unconditionally Secure Quantum Bit Commitment

Horace P. Yuen

Published Feb 24, 2006• 8 citations
arXivHTMLPDF

Abstract

A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocolthat does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.

DOI
10.1007/0-306-47114-0_45

Related papers

Quantum Cryptographic Key Distribution Protocols.

Lelde Lāce, Oksana Scegulnaja-Dubrovska, Ramuns Usovs +1 more

Abstract The application of the principles of quantum mechanics to cryptography has led to a respectable new dimension in confidential communication. As a result of these developments, it is now possible to construct cryptographic communication systems which detect unauthorized eavesdropping should it occur, and which give a incontestable guarantee of no eavesdropping should it not occur. Here several protocols for such communication systems are explored. We first examine quantum bit commitment protocols which are proven as not being unconditionally secure, then, we take a look at proposed protocols which are constructed to disprove the proofs claiming that unconditionally secure quantum bit commitment protocols are impossible.

FCS•Jan 1, 2006•5 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•4 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•5 citations

Unconditionally Secure Quantum Bit Commitment is Impossible

Dominic Mayers

The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.

arXiv:quant-ph/9605044•Physical Review Letters•Apr 28, 1997•767 citations

How to Build Unconditionally Secure Quantum Bit Commitment Protocols

Horace P. Yuen

The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed. Many possibilities for obtaining a secure bit commitment protocol are indicated, purely on the basis of two-way quantum communications, which are not covered by the impossibility proof formulation. They are classified under six new types of protocols, with security proofs for specific examples on four types. Reasons for some previously failed attempts at obtaining secure protocols are also indicated.

arXiv:quant-ph/0305144•May 23, 2003•18 citations

Quantum Cryptography

Ahmed Mahmoud Abbas

Quantum cryptography is known the most up-to-date in domain of realistic cryptography notably the menace of quantum cryptanalysis which threatens security firmness of public key cryptography. Quantum cryptography has a famous scheme known as Quantum Key Exchange (QKE), that administrates generation and distribution of a secured random key between legitimate channel users depicted as sender and receiver. Consequently, such key could be used as a key for one-time pad hybrid cryptosystems to encrypt and authenticate messages over a quantum channel. (QKE) is based on unifying quantum physics concepts and information theory with conventional cryptographic schemes that target to produce a short secret session key between any two legitimate parties. An important phase in key creation of BB84 protocol is Privacy Amplification phase where two interconnecting parties distill highly secret shared key from a larger body of shared key, which is only partially secret. The two legitimate parties publicly exchange information to create a compressed key free from biased bits known by an eavesdropper.

IGI Global eBooks•Jan 1, 2018•0 citations
A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocolthat does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.
Abstract The application of the principles of quantum mechanics to cryptography has led to a respectable new dimension in confidential communication. As a result of these developments, it is now possible to construct cryptographic communication systems which detect unauthorized eavesdropping should it occur, and which give a incontestable guarantee of no eavesdropping should it not occur. Here several protocols for such communication systems are explored. We first examine quantum bit commitment protocols which are proven as not being unconditionally secure, then, we take a look at proposed protocols which are constructed to disprove the proofs claiming that unconditionally secure quantum bit commitment protocols are impossible.
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.
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.
The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.
The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed. Many possibilities for obtaining a secure bit commitment protocol are indicated, purely on the basis of two-way quantum communications, which are not covered by the impossibility proof formulation. They are classified under six new types of protocols, with security proofs for specific examples on four types. Reasons for some previously failed attempts at obtaining secure protocols are also indicated.
Quantum cryptography is known the most up-to-date in domain of realistic cryptography notably the menace of quantum cryptanalysis which threatens security firmness of public key cryptography. Quantum cryptography has a famous scheme known as Quantum Key Exchange (QKE), that administrates generation and distribution of a secured random key between legitimate channel users depicted as sender and receiver. Consequently, such key could be used as a key for one-time pad hybrid cryptosystems to encrypt and authenticate messages over a quantum channel. (QKE) is based on unifying quantum physics concepts and information theory with conventional cryptographic schemes that target to produce a short secret session key between any two legitimate parties. An important phase in key creation of BB84 protocol is Privacy Amplification phase where two interconnecting parties distill highly secret shared key from a larger body of shared key, which is only partially secret. The two legitimate parties publicly exchange information to create a compressed key free from biased bits known by an eavesdropper.