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:2003.12095

Concerning Quantum Identification Without Entanglement

Carlos E. González-Guillén, María Isabel González Vasco, Floyd B. Johnson, Ángel Luis Pérez del Pozo

Published Mar 26, 2020• 1 citation
arXivHTMLPDF

Abstract

Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the intended prover. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki, and give a concrete attack upholding theoretical impossibility results from Lo and Buhrman et al. More precisely, we show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret. While the security of a quantum identity authentication scheme is not formally defined in [1], it is clear that such a definition should somehow imply that an external entity may gain no information on the shared identification scheme (even if he actively participates injecting messages in a protocol execution, which is not assumed in our attack strategy).

DOI
10.48550/arxiv.2003.12095

Related papers

An Attack on Zawadzki’s Quantum Authentication Scheme

Carlos E. González-Guillén, María Isabel González Vasco, Floyd B. Johnson +1 more

Identification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quantum computation, it is indeed desirable to have explicit designs for achieving user identification through quantum resources. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki. We discuss the applicability of the theoretical impossibility results from Lo, Colbeck and Buhrman et al. and formally prove that the protocol must necessarily be insecure. Moreover, to better illustrate our insecurity claim, we present an attack on Zawadzki's protocol and show that by using a simple strategy an adversary may indeed obtain relevant information on the shared identification secret. Specifically, through the use of the principal of conclusive exclusion on quantum measurements, our attack geometrically reduces the key space resulting in the claimed logarithmic security being reduced effectively by a factor of two after only three verification attempts.

Entropy•Mar 25, 2021•19 citations

Two-party quantum identity authentication without entanglement

Yuqi Wang, Liya Jian, Shiming Liu +3 more

This study proposes a two-party quantum identity authentication protocol that does not require the participation of a third party. The protocol can verify the user’s identity without exposing the authentication key information, and it can be implemented with a single-photon state, which does not involve entanglement, enabling it to be combined with existing technologies. The shared key is protected by the protocol and hidden during communication, and the security of the authentication scheme is analyzed and verified under general attack. Further analysis results indicate that this protocol is secure and efficient.

Journal of Applied Physics•Oct 9, 2023•0 citations

Comment on “quantum identity authentication with single photon”

Davide Li Calsi, Paul R. Kohl

Abstract A few years ago Hong et al. (Quantum Inf Process 16:236, 2017) proposed a quantum identity authentication protocol using single photons and executable on currently available quantum hardware. Zawadzki later published two attacks on this protocol, and suggested a mitigation in the same work. In this comment we point out an additional vulnerability that causes the prover Alice to leak a percentage of her secret key at every authentication attempt. The latter is due to a problematic policy in the generation and management of decoy states. We conclude by showing a simple mitigation that addresses the issue.

Quantum Information Processing•Oct 19, 2024•2 citations

Quantum identity authentication for non-entanglement multiparty communication: A review, state of art and future directions

Nur Shahirah Azahari, Nur Ziadah Harun, Zuriati Ahmad Zukarnain

Authentication is one of the security services that assures the system’s adequate security through identification and verification. Additionally, it guarantees that the communication party is who they claim to be. In politics, the economy, banking, daily life, and other areas, quantum identity authentication is essential to guarantee the security of information in communication. The multiphoton strategy is an improved version of the single-photon approach, with higher transmission rates and longer photon travel distances via the Quantum Communication network. Despite the advantages of multiphoton, enforcing authentication on behalf of numerous participants in the quantum channel remains a problem, since existing multiphoton only considers two parties involved in secret message sharing. The issue of scalability arises here when the number of parties involved in the quantum network increases. Furthermore, an eavesdropper might hide her position among other parties and take advantage of the situation to obtain a certain information. Therefore, we require a protocol, that creates a more secure environment in term of authentication in which multiple parties may freely and openly communicate. This paper further identifies research gaps covering critical aspect on how Quantum Identity Authentication (QIA) can be realized and effectively utilized for multiphoton without entanglement based. These include suggestion of future direction to implement multiphoton in multiparty from current protocol.

ICT Express•Mar 7, 2023•12 citations

Authentication of quantum messages

Howard Barnum, Claude Crépeau, Daniel Gottesman +2 more

Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.

arXiv:quant-ph/0205128•Annual Symposium on Foundations of Computer Science•Jun 26, 2003•293 citations

Experimental implementation of a quantum zero-knowledge proof for user authentication

Marta Irene García Cid, Dileepsai Bodanapu, Alberto Gatto +3 more

A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate. It has been implemented in modified Quantum Key Distribution devices executing two fundamental cases. In the first case, all players are honest, while in the second case, one of the users is a malicious player. We demonstrate an increase of the quantum bit error rate around 25% in the latter case compared to the case of honesty. The protocol has also been validated for distances from a back-to-back setup to more than 60 km between verifier and prover. The security and robustness of the protocol has been analysed, demonstrating its completeness, soundness and zero-knowledge properties.

arXiv:2401.09521•Optics Express•Feb 22, 2024•14 citations
Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the intended prover. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki, and give a concrete attack upholding theoretical impossibility results from Lo and Buhrman et al. More precisely, we show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret. While the security of a quantum identity authentication scheme is not formally defined in [1], it is clear that such a definition should somehow imply that an external entity may gain no information on the shared identification scheme (even if he actively participates injecting messages in a protocol execution, which is not assumed in our attack strategy).
Identification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quantum computation, it is indeed desirable to have explicit designs for achieving user identification through quantum resources. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki. We discuss the applicability of the theoretical impossibility results from Lo, Colbeck and Buhrman et al. and formally prove that the protocol must necessarily be insecure. Moreover, to better illustrate our insecurity claim, we present an attack on Zawadzki's protocol and show that by using a simple strategy an adversary may indeed obtain relevant information on the shared identification secret. Specifically, through the use of the principal of conclusive exclusion on quantum measurements, our attack geometrically reduces the key space resulting in the claimed logarithmic security being reduced effectively by a factor of two after only three verification attempts.
This study proposes a two-party quantum identity authentication protocol that does not require the participation of a third party. The protocol can verify the user’s identity without exposing the authentication key information, and it can be implemented with a single-photon state, which does not involve entanglement, enabling it to be combined with existing technologies. The shared key is protected by the protocol and hidden during communication, and the security of the authentication scheme is analyzed and verified under general attack. Further analysis results indicate that this protocol is secure and efficient.
Abstract A few years ago Hong et al. (Quantum Inf Process 16:236, 2017) proposed a quantum identity authentication protocol using single photons and executable on currently available quantum hardware. Zawadzki later published two attacks on this protocol, and suggested a mitigation in the same work. In this comment we point out an additional vulnerability that causes the prover Alice to leak a percentage of her secret key at every authentication attempt. The latter is due to a problematic policy in the generation and management of decoy states. We conclude by showing a simple mitigation that addresses the issue.
Authentication is one of the security services that assures the system’s adequate security through identification and verification. Additionally, it guarantees that the communication party is who they claim to be. In politics, the economy, banking, daily life, and other areas, quantum identity authentication is essential to guarantee the security of information in communication. The multiphoton strategy is an improved version of the single-photon approach, with higher transmission rates and longer photon travel distances via the Quantum Communication network. Despite the advantages of multiphoton, enforcing authentication on behalf of numerous participants in the quantum channel remains a problem, since existing multiphoton only considers two parties involved in secret message sharing. The issue of scalability arises here when the number of parties involved in the quantum network increases. Furthermore, an eavesdropper might hide her position among other parties and take advantage of the situation to obtain a certain information. Therefore, we require a protocol, that creates a more secure environment in term of authentication in which multiple parties may freely and openly communicate. This paper further identifies research gaps covering critical aspect on how Quantum Identity Authentication (QIA) can be realized and effectively utilized for multiphoton without entanglement based. These include suggestion of future direction to implement multiphoton in multiparty from current protocol.
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.
A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate. It has been implemented in modified Quantum Key Distribution devices executing two fundamental cases. In the first case, all players are honest, while in the second case, one of the users is a malicious player. We demonstrate an increase of the quantum bit error rate around 25% in the latter case compared to the case of honesty. The protocol has also been validated for distances from a back-to-back setup to more than 60 km between verifier and prover. The security and robustness of the protocol has been analysed, demonstrating its completeness, soundness and zero-knowledge properties.