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/9809024 · Physical Review A

Quantum identification system

Miloslav Dušek, Ondřej Haderka, Martin Hendrych, Robert Myška

Published Jul 1, 1999• 177 citations
arXivHTMLPDF

Abstract

A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and sequences are ``refueled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.

DOI
10.1103/physreva.60.149

Related papers

Unconditionally-secure and reusable public-key authentication

Lawrence M. Ioannou, Michele Mosca

We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys.

arXiv:1108.2887•Aug 14, 2011•1 citation

AUTHENTICATED QUANTUM KEY DISTRIBUTION WITHOUT CLASSICAL COMMUNICATION

Naya Nagy, Selim G. Akl

The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an authenticated classical channel. This paper presents a totally new perception of communication in such protocols. The quantum communication alone satisfies all needs of array communication between the two parties. Even so, the quantum communication channel does not need to be protected or authenticated whatsoever. As such, our algorithm is a purely quantum key distribution algorithm. The only certain identification of the two parties is through public keys.

Parallel Processing Letters•Sep 1, 2007•16 citations

Practical Quantum No-key Protocol with Identification

Yang Wu, Li Yang

Quantum no-key protocol is a quantum realization of Shamir's idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•4 citations

Approaches to Developing Key Distribution Protocols Based on Quantum Key Distribution

Yenlik Begimbayeva

Quantum protocols for generating shared secret keys represent an effective method of ensuring secure information transmission using quantum communication channels. However, they are limited in scalability due to the physical constraints of quantum channels, which necessitates the use of classical communication channels for exchanging information between participants. This leads to the necessity of developing security threat models and network protection, especially in the case of hybrid networks, where quantum channels are used alongside classical ones. The peculiarity of constructing quantum key distribution protocols is associated with the costliness of implementation and implies the inevitable use of classical communication channels for key distribution. This paper addresses the task of ensuring the security of communication between subscribers not directly connected by quantum channels, through intermediary nodes, and analyzes threats from internal and external adversaries. Special attention is paid to situations where both types of adversaries have information about the processes and protocols in the network. The paper examines widely used key distribution protocols employed in practice. It describes the main security requirements applied to key distribution protocols, and presents the results of an analysis of the compliance of the discussed protocols with these requirements

Journal of Electrical Systems•May 4, 2024•0 citations

Quantum key distribution with authentication

Guihua Zeng, Xinmei Wang

The security of the previous quantum key distribution (QKD) protocols, which is guaranteed by the nature of physics law, is based on the legitimate users. However, impersonation of the legitimate communicators by eavesdroppers, in practice, will be inevitable. In fact, the previous QKD protocols is unsecure without authentication in practical communication. In this paper, we proposed an improved QKD protocol that can simultaneously distribute the quantum secret key and verify the communicators' identity. This presented authentication scheme is provably secure.

arXiv:quant-ph/9812022•Dec 10, 1998•6 citations

Authority-based user authentication in quantum key distribution

Daniel Ljunggren, Mohamed Bourennane, Anders Karlsson

We propose secure protocols for user authenticated quantum key distribution on jammable public channels between two parties, Alice and Bob. Via an arbitrator, Trent, these protocols provide data integrity and mutual identification of the messenger and recipient. The first three are based on single-photon generation and detection. The first and second require (initially) an unjammable channel between the arbitrator and each party. The third requires one broadcast from the arbitrator, disclosing what type of deterministic modification of the states sent through the quantum channel was done by him. The fourth and fifth protocols are based on two-particle entanglement with a preselection of nonorthogonal superpositions of Bell states. These two protocols also require one broadcast from the arbitrator disclosing the type of entangled state in each sending.

Physical Review A•Jul 13, 2000•111 citations
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and sequences are ``refueled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.
The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an authenticated classical channel. This paper presents a totally new perception of communication in such protocols. The quantum communication alone satisfies all needs of array communication between the two parties. Even so, the quantum communication channel does not need to be protected or authenticated whatsoever. As such, our algorithm is a purely quantum key distribution algorithm. The only certain identification of the two parties is through public keys.
Quantum no-key protocol is a quantum realization of Shamir's idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.
Quantum protocols for generating shared secret keys represent an effective method of ensuring secure information transmission using quantum communication channels. However, they are limited in scalability due to the physical constraints of quantum channels, which necessitates the use of classical communication channels for exchanging information between participants. This leads to the necessity of developing security threat models and network protection, especially in the case of hybrid networks, where quantum channels are used alongside classical ones. The peculiarity of constructing quantum key distribution protocols is associated with the costliness of implementation and implies the inevitable use of classical communication channels for key distribution. This paper addresses the task of ensuring the security of communication between subscribers not directly connected by quantum channels, through intermediary nodes, and analyzes threats from internal and external adversaries. Special attention is paid to situations where both types of adversaries have information about the processes and protocols in the network. The paper examines widely used key distribution protocols employed in practice. It describes the main security requirements applied to key distribution protocols, and presents the results of an analysis of the compliance of the discussed protocols with these requirements
The security of the previous quantum key distribution (QKD) protocols, which is guaranteed by the nature of physics law, is based on the legitimate users. However, impersonation of the legitimate communicators by eavesdroppers, in practice, will be inevitable. In fact, the previous QKD protocols is unsecure without authentication in practical communication. In this paper, we proposed an improved QKD protocol that can simultaneously distribute the quantum secret key and verify the communicators' identity. This presented authentication scheme is provably secure.
We propose secure protocols for user authenticated quantum key distribution on jammable public channels between two parties, Alice and Bob. Via an arbitrator, Trent, these protocols provide data integrity and mutual identification of the messenger and recipient. The first three are based on single-photon generation and detection. The first and second require (initially) an unjammable channel between the arbitrator and each party. The third requires one broadcast from the arbitrator, disclosing what type of deterministic modification of the states sent through the quantum channel was done by him. The fourth and fifth protocols are based on two-particle entanglement with a preselection of nonorthogonal superpositions of Bell states. These two protocols also require one broadcast from the arbitrator disclosing the type of entangled state in each sending.