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/0001046

Quantum authentication protocol

Guihua Zeng, Guang-Can Guo

Published Jan 13, 2000• 10 citations
arXivHTMLPDF

Abstract

In this letter, we proposed a quantum authentication protocol. The authentication process is implemented by the symmetric cryptographic scheme with quantum effects.
DOI
10.48550/arxiv.quant-ph/0001046

Related papers

Quantum-resistant authentication: Securing identity and data against quantum threats

Ana Isabel González-Tablas, Universidad Carlos Ⅲ de Madrid, Dpto. de Informática, COSEC Lab. Avda. de la Universidad, 30. 28911 Leganés, Madrid, España, María Isabel González Vasco +1 more

Quantum computing presents a significant threat to traditional cryptographic protocols, particularly those relying on the hardness of factoring large integers and computing discrete logarithms, as quantum algorithms can solve these problems in polynomial time. With the advent of quantum computers capable of breaking current cryptographic schemes, the need for quantum-resistant cryptographic mechanisms has become increasingly urgent. In this paper, we focused on authentication, a critical security property, and reviewed various classical cryptographic techniques to this aim and their potential to resist quantum attacks. We present a (non-exhaustive) overview of the state of the art in quantum-resistant authentication, particularly through symmetric cryptography, digital signatures, and hardware-based approaches such as physical unclonable functions ($\textsf{PUF}$s). By offering a clear and focused analysis, we used this survey to bridge the gap between diverse academic communities and provide a foundation for future research in post-quantum authentication.

AIMS Mathematics•Jan 1, 2025•0 citations

On quantum authentication protocols

Yoshito Kanamori, Seong-Moo Yoo, Don A. Gregory +1 more

When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.

Globecom•Jan 1, 2005•23 citations

Simplified Channel Authentication Algorithm for Secure Quantum Key Distribution

Mohamed Youssef Khalaf Elwadeya, Khalid A. Saeed Al-Khateeb, Nurul Fadzlin Hasbullah

Quantum key distribution (QKD) is characterized by the implementation of the principles of quantum mechanics in distributing the symmetric cryptographic key between two communicating stations. The quantum channel through which a light beam travels and then examined quantum-mechanically is governed by several quantum cryptographic protocols. This paper presents a simplified algorithm of the quantum authentication process (QAP) of the six-state deterministic quantum protocol (6DP). The proposed setup replaces the nonlinear crystal BBO which is responsible for the second harmonic generation process with a simple polarization splitting using Glan Thompson Polarizer (GTP).

International Conference on Computer and Communication Engineering•Sep 1, 2014•0 citations

A non-interactive quantum deniable authentication protocol based on asymmetric quantum cryptography

Wei‐Min Shi, Jan-Biao Zhang, Yi‐Hua Zhou +2 more

Optik•Jun 26, 2016•4 citations

Provably Secure Symmetric-Key Privacy-Preserving authenticated key agreement protocol

Liang Ni, Hengsheng Zhou, Yawei Zhang +2 more

In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.

International Conference on Communication and Network Security (ICCNS)•Dec 6, 2023•0 citations

Quantum Signature and Identity Authentication Scheme Based on Quantum Public Key

Yun‐Long Wu, jinqing Li, Xiaoqiang Di +2 more

•Jan 1, 2024•1 citation
Quantum computing presents a significant threat to traditional cryptographic protocols, particularly those relying on the hardness of factoring large integers and computing discrete logarithms, as quantum algorithms can solve these problems in polynomial time. With the advent of quantum computers capable of breaking current cryptographic schemes, the need for quantum-resistant cryptographic mechanisms has become increasingly urgent. In this paper, we focused on authentication, a critical security property, and reviewed various classical cryptographic techniques to this aim and their potential to resist quantum attacks. We present a (non-exhaustive) overview of the state of the art in quantum-resistant authentication, particularly through symmetric cryptography, digital signatures, and hardware-based approaches such as physical unclonable functions (PUF\textsf{PUF}PUFs). By offering a clear and focused analysis, we used this survey to bridge the gap between diverse academic communities and provide a foundation for future research in post-quantum authentication.
When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.
Quantum key distribution (QKD) is characterized by the implementation of the principles of quantum mechanics in distributing the symmetric cryptographic key between two communicating stations. The quantum channel through which a light beam travels and then examined quantum-mechanically is governed by several quantum cryptographic protocols. This paper presents a simplified algorithm of the quantum authentication process (QAP) of the six-state deterministic quantum protocol (6DP). The proposed setup replaces the nonlinear crystal BBO which is responsible for the second harmonic generation process with a simple polarization splitting using Glan Thompson Polarizer (GTP).
In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.