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:2504.11552 · Quantum Science and Technology

Hybrid authentication protocols for advanced quantum networks

Suchetana Goswami, Mina Doosti, Elham Kashefi

Published Sep 17, 2026• 7 citations
arXivHTMLPDF

Abstract

Abstract Authentication is a fundamental building block of secure quantum networks, essential for quantum cryptographic protocols and often debated as a key limitation of quantum key distribution in security standards. Most quantum-safe authentication schemes rely on small pre-shared keys or post-quantum computational assumptions. In this work, we introduce a new authentication approach that combines hardware assumptions, particularly physical unclonable functions (PUFs), along with fundamental quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols. We propose two protocols for different scenarios in entanglement-enabled quantum networks. The first protocol, referred to as the offline protocol, requires pre-distributed entangled states but no quantum communication during the authentication phase. It enables a server to authenticate clients at any time with only minimal classical communication. The second, an online protocol, requires quantum communication but only necessitates entangled state generation on the Prover ’s side. For this, we introduce a novel hardware module, the hybrid entangled PUF. Both protocols use weakly secure, off-the-shelf classical PUFs as their hardware module, yet we prove that quantum properties such as local indistinguishability enable exponential security for authentication, even in a single round. We provide full security analysis for both protocols and establish them as the first entanglement-based extension of hardware-based quantum authentication. These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.

DOI
10.1088/2058-9565/aea927

Related papers

Unconditional Authentication in Quantum Key Distribution via Hybrid Entangled Physical Unclonable Functions

Nicolas Laurent-Puig, Mina Doosti, Adriano Innocenzi +1 more

Quantum Key Distribution (QKD) enables Information-Theoretically Secure (ITS) key exchange, robust even against future quantum computing threats. However, a fundamental limitation of QKD is the requirement for an authenticated classical channel, which necessitates a pre-shared secret key. In this work, we address this challenge by adopting a Hybrid Entangled Physical Unclonable Function (PUF) protocol for authentication. We demonstrate that this PUF-based method generates an ITS initial key under minimal explicit hardware assumptions. This approach allows us to experimentally perform a fully ITS-authenticated entanglement-based QKD protocol that relies solely on such assumptions, effectively eliminating the need for pre-shared secrets. This represents a significant step towards the practical realization of quantum network protocols using lightweight, readily available hardware assumptions, without weakening security guarantees.

quant-pharXiv:2605.04650•Physical Review Research•May 7, 2026•3 citations

PU-QKD: Enhancing Authentication of Quantum Key Distribution via Physical Unclonable Function

Mieszko Ferens, Edlira Dushku, Simon Rommel +2 more

The rapid advances in quantum computing pressure the existing essential cryptographic algorithms. In this context, Quantum Key Distribution (QKD) has been proposed as a quantum safe solution for key distribution. However, current QKD systems require an authenticated classical channel which relies on pre-shared symmetric keys that are manually distributed and do not guarantee the identity of the hardware that hosts them. This paper proposes a novel scheme, the Physically Unclonable Quantum Key Distribution (PU-QKD) system, to intrinsically authenticate the communicating endpoints in QKD. The PU-QKD scheme leverages classical Physical Unclonable Functions (PUFs) to encode the data transmission in discrete variable QKD protocols (e.g., BB84). Our scheme maintains the information-theoretic security of QKD protocols by integrating the PUF as an additional layer. Authentication is bound to hardware, providing a robust fingerprint, while lower post-processing overhead increases key rates. Additionally, the proposed scheme is resilient against state-of-the-art PUF vulnerabilities, such as modeling attacks.

Globecom•Dec 8, 2025•2 citations

Authentication in Quantum Networks

Christopher Battarbee, Suchetana Goswami, Elham Kashefi +1 more

In this review, we survey the cryptographic task of authentication from the perspective of quantum communication. We review three main flavours of authentication that are often conflated in the literature: authentication of classical messages, authentication of quantum messages, and entity authentication, also covering recent hardware-assisted approaches. We compare representative protocols for each functionality in terms of their security assumptions, set-up requirements, composability, and scalability in large or dynamic networks, and use these criteria to identify and recommend suitable candidates. Finally, applications are surveyed: we provide a detailed case study of authentication and quantum key distribution (QKD), then extend the discussion to protocols beyond QKD, where the role of authentication is more complex. Our take-home message is that an authentication requirement is not an intrinsic limitation of quantum networks: as with all secure communication, each protocol relies on a particular authentication resource, and the security claim of that protocol is meaningful only once the authentication resource and its deployment assumptions are made explicit. At the same time, the existing classical and quantum literature already offers a range of quantum-secure authentication schemes, which can support different applications when carefully matched to the required functionality, assumptions, and security guarantees.

quant-pharXiv:2606.30636•Jun 30, 2026•0 citations

Practical Evaluation of a Quantum Physical Unclonable Function and Design of an Authentication Scheme

Franco Cirillo, Christian Esposito

With the increase of digital devices, the need for robust authentication mechanisms has become crucial. Traditional methods relying on cryptographic key management are susceptible to various risks, particularly the exposure of keys to interception or theft. As cyber threats evolve, the short-comings of these methods are accentuated, necessitating more secure solutions. Physically Unclonable Functions (PUFs) have emerged as a potential alternative, utilizing inherent hardware variations for device authentication without stored secrets. However, recent studies reveal vulnerabilities in conventional PUF implementations. Simultaneously, there's a growing recognition for authentication mechanisms tailored for quantum devices. This recognition has prompted the exploration of Quantum PUFs (QPUFs), which represent a promising solution to enhance security and reliability, leveraging the unique properties of quantum mechanics. In this paper, we propose a novel approach using QPUFs for device authentication that does not require any quantum communication channel or even quantum memory. We design a quantum circuit to serve as a QPUF, evaluating metrics such as instability, randomness, and uniqueness. Additionally, we devise an authentication scheme that exploits the challenge-response paradigm, taking advantage of the distinctive properties of quantum PUFs. Furthermore, we delineate a threat model to identify and mitigate potential risks associated with the authentication process. By assessing the proposed QPUFs efficacy on real real quantum hardware provided by IBM, this research contributes to the advancement of secure authentication protocols in quantum era.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•10 citations

Quantum Lock: A Provable Quantum Communication Advantage

Kaushik Chakraborty, Mina Doosti, Yao Ma +3 more

Physical unclonable functions(PUFs) provide a unique fingerprint to a physical entity by exploiting the inherent physical randomness. Gao et al. discussed the vulnerability of most current-day PUFs to sophisticated machine learning-based attacks. We address this problem by integrating classical PUFs and existing quantum communication technology. Specifically, this paper proposes a generic design of provably secure PUFs, called hybrid locked PUFs(HLPUFs), providing a practical solution for securing classical PUFs. An HLPUF uses a classical PUF(CPUF), and encodes the output into non-orthogonal quantum states to hide the outcomes of the underlying CPUF from any adversary. Here we introduce a quantum lock to protect the HLPUFs from any general adversaries. The indistinguishability property of the non-orthogonal quantum states, together with the quantum lockdown technique prevents the adversary from accessing the outcome of the CPUFs. Moreover, we show that by exploiting non-classical properties of quantum states, the HLPUF allows the server to reuse the challenge-response pairs for further client authentication. This result provides an efficient solution for running PUF-based client authentication for an extended period while maintaining a small-sized challenge-response pairs database on the server side. Later, we support our theoretical contributions by instantiating the HLPUFs design using accessible real-world CPUFs. We use the optimal classical machine-learning attacks to forge both the CPUFs and HLPUFs, and we certify the security gap in our numerical simulation for construction which is ready for implementation.

arXiv:2110.09469•Quantum•May 23, 2023•21 citations

Client-server Identification Protocols with Quantum PUF

Mina Doosti, Niraj Kumar, Mahshid Delavar +1 more

Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware-secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice versa. Unlike existing identification protocols based on Quantum Read-out PUFs that rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties. We provide a comprehensive comparison between the two proposed protocols in terms of resources such as quantum memory and computing ability required in both parties as well as the communication overhead between them.

arXiv:2006.04522•ACM Transactions on Quantum Computing•Sep 30, 2021•33 citations
Abstract Authentication is a fundamental building block of secure quantum networks, essential for quantum cryptographic protocols and often debated as a key limitation of quantum key distribution in security standards. Most quantum-safe authentication schemes rely on small pre-shared keys or post-quantum computational assumptions. In this work, we introduce a new authentication approach that combines hardware assumptions, particularly physical unclonable functions (PUFs), along with fundamental quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols. We propose two protocols for different scenarios in entanglement-enabled quantum networks. The first protocol, referred to as the offline protocol, requires pre-distributed entangled states but no quantum communication during the authentication phase. It enables a server to authenticate clients at any time with only minimal classical communication. The second, an online protocol, requires quantum communication but only necessitates entangled state generation on the Prover ’s side. For this, we introduce a novel hardware module, the hybrid entangled PUF. Both protocols use weakly secure, off-the-shelf classical PUFs as their hardware module, yet we prove that quantum properties such as local indistinguishability enable exponential security for authentication, even in a single round. We provide full security analysis for both protocols and establish them as the first entanglement-based extension of hardware-based quantum authentication. These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.
Quantum Key Distribution (QKD) enables Information-Theoretically Secure (ITS) key exchange, robust even against future quantum computing threats. However, a fundamental limitation of QKD is the requirement for an authenticated classical channel, which necessitates a pre-shared secret key. In this work, we address this challenge by adopting a Hybrid Entangled Physical Unclonable Function (PUF) protocol for authentication. We demonstrate that this PUF-based method generates an ITS initial key under minimal explicit hardware assumptions. This approach allows us to experimentally perform a fully ITS-authenticated entanglement-based QKD protocol that relies solely on such assumptions, effectively eliminating the need for pre-shared secrets. This represents a significant step towards the practical realization of quantum network protocols using lightweight, readily available hardware assumptions, without weakening security guarantees.
The rapid advances in quantum computing pressure the existing essential cryptographic algorithms. In this context, Quantum Key Distribution (QKD) has been proposed as a quantum safe solution for key distribution. However, current QKD systems require an authenticated classical channel which relies on pre-shared symmetric keys that are manually distributed and do not guarantee the identity of the hardware that hosts them. This paper proposes a novel scheme, the Physically Unclonable Quantum Key Distribution (PU-QKD) system, to intrinsically authenticate the communicating endpoints in QKD. The PU-QKD scheme leverages classical Physical Unclonable Functions (PUFs) to encode the data transmission in discrete variable QKD protocols (e.g., BB84). Our scheme maintains the information-theoretic security of QKD protocols by integrating the PUF as an additional layer. Authentication is bound to hardware, providing a robust fingerprint, while lower post-processing overhead increases key rates. Additionally, the proposed scheme is resilient against state-of-the-art PUF vulnerabilities, such as modeling attacks.
In this review, we survey the cryptographic task of authentication from the perspective of quantum communication. We review three main flavours of authentication that are often conflated in the literature: authentication of classical messages, authentication of quantum messages, and entity authentication, also covering recent hardware-assisted approaches. We compare representative protocols for each functionality in terms of their security assumptions, set-up requirements, composability, and scalability in large or dynamic networks, and use these criteria to identify and recommend suitable candidates. Finally, applications are surveyed: we provide a detailed case study of authentication and quantum key distribution (QKD), then extend the discussion to protocols beyond QKD, where the role of authentication is more complex. Our take-home message is that an authentication requirement is not an intrinsic limitation of quantum networks: as with all secure communication, each protocol relies on a particular authentication resource, and the security claim of that protocol is meaningful only once the authentication resource and its deployment assumptions are made explicit. At the same time, the existing classical and quantum literature already offers a range of quantum-secure authentication schemes, which can support different applications when carefully matched to the required functionality, assumptions, and security guarantees.
With the increase of digital devices, the need for robust authentication mechanisms has become crucial. Traditional methods relying on cryptographic key management are susceptible to various risks, particularly the exposure of keys to interception or theft. As cyber threats evolve, the short-comings of these methods are accentuated, necessitating more secure solutions. Physically Unclonable Functions (PUFs) have emerged as a potential alternative, utilizing inherent hardware variations for device authentication without stored secrets. However, recent studies reveal vulnerabilities in conventional PUF implementations. Simultaneously, there's a growing recognition for authentication mechanisms tailored for quantum devices. This recognition has prompted the exploration of Quantum PUFs (QPUFs), which represent a promising solution to enhance security and reliability, leveraging the unique properties of quantum mechanics. In this paper, we propose a novel approach using QPUFs for device authentication that does not require any quantum communication channel or even quantum memory. We design a quantum circuit to serve as a QPUF, evaluating metrics such as instability, randomness, and uniqueness. Additionally, we devise an authentication scheme that exploits the challenge-response paradigm, taking advantage of the distinctive properties of quantum PUFs. Furthermore, we delineate a threat model to identify and mitigate potential risks associated with the authentication process. By assessing the proposed QPUFs efficacy on real real quantum hardware provided by IBM, this research contributes to the advancement of secure authentication protocols in quantum era.
Physical unclonable functions(PUFs) provide a unique fingerprint to a physical entity by exploiting the inherent physical randomness. Gao et al. discussed the vulnerability of most current-day PUFs to sophisticated machine learning-based attacks. We address this problem by integrating classical PUFs and existing quantum communication technology. Specifically, this paper proposes a generic design of provably secure PUFs, called hybrid locked PUFs(HLPUFs), providing a practical solution for securing classical PUFs. An HLPUF uses a classical PUF(CPUF), and encodes the output into non-orthogonal quantum states to hide the outcomes of the underlying CPUF from any adversary. Here we introduce a quantum lock to protect the HLPUFs from any general adversaries. The indistinguishability property of the non-orthogonal quantum states, together with the quantum lockdown technique prevents the adversary from accessing the outcome of the CPUFs. Moreover, we show that by exploiting non-classical properties of quantum states, the HLPUF allows the server to reuse the challenge-response pairs for further client authentication. This result provides an efficient solution for running PUF-based client authentication for an extended period while maintaining a small-sized challenge-response pairs database on the server side. Later, we support our theoretical contributions by instantiating the HLPUFs design using accessible real-world CPUFs. We use the optimal classical machine-learning attacks to forge both the CPUFs and HLPUFs, and we certify the security gap in our numerical simulation for construction which is ready for implementation.
Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware-secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice versa. Unlike existing identification protocols based on Quantum Read-out PUFs that rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties. We provide a comprehensive comparison between the two proposed protocols in terms of resources such as quantum memory and computing ability required in both parties as well as the communication overhead between them.