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/0311085 · Quantum Information and Computation

A quantum cryptographic protocol with detection of compromised server

D. Richard Kuhn

Published Nov 1, 2005• 7 citations
arXivHTMLPDF

Abstract

This paper presents a server-based hybrid cryptographic protocol, using quantum and classical resources, to generate a key for authentication and optionally for encryption in a network. A novel feature of the protocol is that it can detect a compromised server. Additional advantages are that it avoids the requirement for timestamps used in classical protocols, guarantees that the trusted server cannot know the authentication key, can provide resistance to multiple photon attacks, and can be used with BB84 or other quantum key distribution protocols. Each resource shares a previously distributed secret key with the trusted server, and resources can communicate with the server using both classical and quantum channels. Resources do not share secret keys with each other, so that the key distribution problem for the network is reduced from O(n^2) to O(n).

DOI
10.26421/qic5.7-3

Related papers

Unconditionally Secure Authentication in Quantum Key Distribution

Sufyan T. F. Al-Janabi

Quantum key distribution (QKD) is a method using some properties of quantum mechanics to create a secret shared cryptographic key even if an eavesdropper has access to unlimited computational power. All QKD protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-themiddle attacks. This paper studies QKD from this point of view, emphasizing the necessity and sufficiency of using unconditionally secure authentication in QKD. In this work, a hybrid unconditionally secure authentication strategy is proposed for QKD protocols. It is based on a mixture of normal application of authentication codes and the so-called "counter-based" authentication method such that to achieve a better trade off between security and efficiency (in terms of the required size of initially shared secret data). Based on this strategy, a complete authenticated QKD protocol is described for a specific implementation of the well-known BB84 protocol. Some advantages of our protocol in comparison to other proposals are also highlighted.

Anbar journal for engineering sciences/Mağallaẗ al-anbār li-l-ʻulūm al-handasiyyaẗ•Dec 1, 2006•0 citations

Enhanced Network Security Protocols for the Quantum Era: Combining Classical and Post-Quantum Cryptography, and Quantum Key Distribution

Carlos Rubio García, Abraham Cano Aguilera, Catalina Stan +3 more

The emergence of quantum computing poses a threat to classical cryptography algorithms, necessitating a shift to quantum secure cryptography. Hybrid protocols combining at least one classical and one quantum-resistant cryptographic algorithm are becoming the standard for securing communications. In this work, we present our novel solution for integrating three different cryptographic assumptions (two of them quantumresistant) into hybrid network security protocols, ensuring that three different cryptographic assumptions must be broken before the protocol becomes vulnerable. Our solution allows for a seamless integration of classical and post-quantum (PQ) cryptography, and quantum key distribution (QKD) into existing network security protocols (e.g., TLS, IPsec) without any major modifications to the protocols themselves. This crypto-agility ensures the mitigation of some of the most well known challenges of both PQ cryptography and QKD. Our findings demonstrate the feasibility of such triple-hybrid network security protocols, showing non-substantial decrease in performance and almost no added packet overhead compared to state of the art protocols. In exchange, we pave the way towards next generation networks where the potential of new quantum-resistant cryptographic schemes can be leveraged in a dynamic and agile fashion, thus fostering a new era of unbreakable communication systems.

IEEE Journal on Selected Areas in Communications•May 13, 2025•47 citations

A theoretical scheme for multi-user quantum authentication and key distribution in a network

Yu‐Guang Yang, Wen Qiao-yan, Fu-Chen Zhu +1 more

A theoretical scheme for multi-user quantum authentication and key distribution in a network is proposed. Similar to the authentication architecture of the netw ork in classical cryptography, a distributed client/server architecture with the shared Einstein-Podolsky-Rosen(EPR) entangled pairs between each user and his t rusted server used for the authentication and key distribution is proposed. Base d on this architecture, any-to-any multi-user quantum authentication and key dis tribution is realized. The trusted server only provides the authentication betwe en users and swaps the entanglement between the particles so as to entangle the particles of the two users who want to communicate secretly. The key generation is performed by the requesting user. Each user in a network only shares Einstein -Podolsky-Rosen entangled pairs with the trusted server and communicates with th e trusted server through the classical channel and quantum channel. Users need n ot share EPR entangled pairs with each other so that the number of EPR pairs in the network is reduced from O(n2) to O(n).

Acta Physica Sinica•Jan 1, 2005•9 citations

Quantum Token for Network Authentication

Huimin Chen, Heng-Yue Jia, Xia Wu +2 more

Classical token-based authentication can play a significant role in the web security check without accessing the database. For example, JSON Web Tokens (JWT) has been used to support scenarios such as single-sign-on. However, with the development of quantum computer, the security of JWT relying on the RSA algorithm would be compromised. Therefore, we propose a protocol to realize network authentication utilizing quantum token. Inspired by the structure of classical JWT, the structure of quantum token also consists of three parts: header, payload and quantum information. After the user logs in successfully, the quantum token can be issued by the server. If the user presents the quantum token to access again during the validity period, the server can verify whether the quantum token is valid. Our quantum token protocol can detect eavesdropping and achieve identity authentication. We also conduct a security analysis of the proposed protocol by addressing possible motives of an Eavesdropper and conclude the approach to be resilient against a broad range of attacks.

IEEE International Conference on Web Services (ICWS)•Sep 1, 2021•6 citations

Three Party Post Quantum Secure Lattice Based Construction of Authenticated Key Establishment Protocol for Mobile Communication

Sunil Kumar, Gaurav Mittal, Arvind Yadav

ABSTRACT A three‐party post‐quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric‐key encryption AES‐256 algorithm. Although there are few third‐party post‐quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.

Concurrency and Computation Practice and Experience•Jan 20, 2025•6 citations

Quantum-Inspired Cryptography Based on Entanglement Distribution

Jincheng Zhang

This paper explores a novel cryptographic approach rooted in quantum mechanics, specifically utilizing the principles of entanglement distribution. Traditional cryptographic algorithms are increasingly threatened by the potential advancements in quantum computing, necessitating the development of new security paradigms. This proposal outlines a cryptographic protocol designed to exploit the unique properties of entanglement to achieve robust security. The protocol's core relies on the generation and distribution of entangled photon pairs, where any attempt to intercept or measure the photons disrupts the entanglement, immediately alerting the legitimate parties. We present a detailed mathematical formulation of the protocol, emphasizing the key elements of key distribution, secret sharing, and authentication. The inherent quantum nature of the protocol—specifically its reliance on the non-locality of entanglement—creates a significantly higher barrier to attack compared to classical cryptographic methods. The proposed system provides a potential solution for secure communication in a post-quantum era, offering a fundamentally different approach to cryptography that leverages the mysteries of quantum mechanics. The theoretical analysis demonstrates the protocol's security properties and highlights its potential advantages.

•Sep 6, 2026•0 citations
This paper presents a server-based hybrid cryptographic protocol, using quantum and classical resources, to generate a key for authentication and optionally for encryption in a network. A novel feature of the protocol is that it can detect a compromised server. Additional advantages are that it avoids the requirement for timestamps used in classical protocols, guarantees that the trusted server cannot know the authentication key, can provide resistance to multiple photon attacks, and can be used with BB84 or other quantum key distribution protocols. Each resource shares a previously distributed secret key with the trusted server, and resources can communicate with the server using both classical and quantum channels. Resources do not share secret keys with each other, so that the key distribution problem for the network is reduced from O(n^2) to O(n).
Quantum key distribution (QKD) is a method using some properties of quantum mechanics to create a secret shared cryptographic key even if an eavesdropper has access to unlimited computational power. All QKD protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-themiddle attacks. This paper studies QKD from this point of view, emphasizing the necessity and sufficiency of using unconditionally secure authentication in QKD. In this work, a hybrid unconditionally secure authentication strategy is proposed for QKD protocols. It is based on a mixture of normal application of authentication codes and the so-called "counter-based" authentication method such that to achieve a better trade off between security and efficiency (in terms of the required size of initially shared secret data). Based on this strategy, a complete authenticated QKD protocol is described for a specific implementation of the well-known BB84 protocol. Some advantages of our protocol in comparison to other proposals are also highlighted.
The emergence of quantum computing poses a threat to classical cryptography algorithms, necessitating a shift to quantum secure cryptography. Hybrid protocols combining at least one classical and one quantum-resistant cryptographic algorithm are becoming the standard for securing communications. In this work, we present our novel solution for integrating three different cryptographic assumptions (two of them quantumresistant) into hybrid network security protocols, ensuring that three different cryptographic assumptions must be broken before the protocol becomes vulnerable. Our solution allows for a seamless integration of classical and post-quantum (PQ) cryptography, and quantum key distribution (QKD) into existing network security protocols (e.g., TLS, IPsec) without any major modifications to the protocols themselves. This crypto-agility ensures the mitigation of some of the most well known challenges of both PQ cryptography and QKD. Our findings demonstrate the feasibility of such triple-hybrid network security protocols, showing non-substantial decrease in performance and almost no added packet overhead compared to state of the art protocols. In exchange, we pave the way towards next generation networks where the potential of new quantum-resistant cryptographic schemes can be leveraged in a dynamic and agile fashion, thus fostering a new era of unbreakable communication systems.
A theoretical scheme for multi-user quantum authentication and key distribution in a network is proposed. Similar to the authentication architecture of the netw ork in classical cryptography, a distributed client/server architecture with the shared Einstein-Podolsky-Rosen(EPR) entangled pairs between each user and his t rusted server used for the authentication and key distribution is proposed. Base d on this architecture, any-to-any multi-user quantum authentication and key dis tribution is realized. The trusted server only provides the authentication betwe en users and swaps the entanglement between the particles so as to entangle the particles of the two users who want to communicate secretly. The key generation is performed by the requesting user. Each user in a network only shares Einstein -Podolsky-Rosen entangled pairs with the trusted server and communicates with th e trusted server through the classical channel and quantum channel. Users need n ot share EPR entangled pairs with each other so that the number of EPR pairs in the network is reduced from O(n2) to O(n).
Classical token-based authentication can play a significant role in the web security check without accessing the database. For example, JSON Web Tokens (JWT) has been used to support scenarios such as single-sign-on. However, with the development of quantum computer, the security of JWT relying on the RSA algorithm would be compromised. Therefore, we propose a protocol to realize network authentication utilizing quantum token. Inspired by the structure of classical JWT, the structure of quantum token also consists of three parts: header, payload and quantum information. After the user logs in successfully, the quantum token can be issued by the server. If the user presents the quantum token to access again during the validity period, the server can verify whether the quantum token is valid. Our quantum token protocol can detect eavesdropping and achieve identity authentication. We also conduct a security analysis of the proposed protocol by addressing possible motives of an Eavesdropper and conclude the approach to be resilient against a broad range of attacks.
ABSTRACT A three‐party post‐quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric‐key encryption AES‐256 algorithm. Although there are few third‐party post‐quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.
This paper explores a novel cryptographic approach rooted in quantum mechanics, specifically utilizing the principles of entanglement distribution. Traditional cryptographic algorithms are increasingly threatened by the potential advancements in quantum computing, necessitating the development of new security paradigms. This proposal outlines a cryptographic protocol designed to exploit the unique properties of entanglement to achieve robust security. The protocol's core relies on the generation and distribution of entangled photon pairs, where any attempt to intercept or measure the photons disrupts the entanglement, immediately alerting the legitimate parties. We present a detailed mathematical formulation of the protocol, emphasizing the key elements of key distribution, secret sharing, and authentication. The inherent quantum nature of the protocol—specifically its reliance on the non-locality of entanglement—creates a significantly higher barrier to attack compared to classical cryptographic methods. The proposed system provides a potential solution for secure communication in a post-quantum era, offering a fundamentally different approach to cryptography that leverages the mysteries of quantum mechanics. The theoretical analysis demonstrates the protocol's security properties and highlights its potential advantages.