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

IEEE International Symposium on Information Theory (ISIT)

Reusability in Quantum PUF and Biometric Sources

Kumar Nilesh, Christian Deppe, Holger Boche

Published Jun 1, 2026• 1 citation
Publisher

Abstract

Quantum Physically Unclonable Functions (QPUFs) and quantum biometric responses offer provably secure authentication primitives whose unclonability is grounded in the laws of quantum mechanics. However, in practicality, the same physical source is often reused across multiple, mutually untrusted systems, raising fundamental questions about privacy leakage, key independence, and long-term security. We have developed a unified information-theoretic framework for reusable QPUF and quantum biometric-based authentication. Reliability, secrecy, inter-system key independence, and privacy leakage are formalized to study two realistic design paradigms: the joint design model and the legacy-compatible incremental design model. For classical–quantum enrollment, single-letter characterizations of the achievable key rate–privacy regions are derived, and explicit coding schemes attaining the bounds are provided. For fully quantum enrollment, multi-letter characterizations are obtained, reflecting the necessity of collective quantum operations. These results are then extended to secret key binding protocols. Our results rigorously quantify the cost of reusability and establish fundamental limits for scalable, privacy-preserving quantum authentication systems.

DOI
10.1109/isit62367.2026.11654111

Related papers

Quantum PUF and Quantum Biometric-Based Identification Supporting Authentication

Kumar Nilesh, Christian Deppe, Marc Geitz +1 more

The fundamental information-theoretic limits of secure identification and authentication protocols that leverage Quantum Physical Unclonable Functions (QPUFs) and Quantum Biometrics are established in this paper. A unified theoretical framework is developed for enrollment-based identification systems with key generation that encompasses both QPUF-based device fingerprinting and quantum biometric modalities. This framework extends classical models of identification and key generation to both classical-quantum (c-q) and quantum-quantum (q-q) settings. The primary contribution of this work is the derivation of the complete, single-letter capacity region for the c-q model, which characterizes the ultimate trade-offs between the identification rate, secret-key rate, privacy-leakage rate, and public-storage rate. Furthermore, we establish a tight achievable region for the more general q-q model, quantifying the potential performance gains achievable with coherent quantum correlations. These results are also shown to hold for secret-key binding protocols, demonstrating an equivalence between key generation and secure storage. These findings provide comprehensive information-theoretic foundations for the design and analysis of secure, scalable, and privacy-preserving identification systems.

International Conference on Communications•May 24, 2026•2 citations

Authentication Based on Quantum PUF

Kumar Nilesh, Christian Deppe, Holger Boche

An information-theoretic analysis of secure authentication based on Quantum Physically Unclonable Functions (QPUF) is presented in this paper. The proposed model employs a secret key generated through QPUF to authenticate pre-enrolled user and device identities while maintaining secrecy and limiting privacy leakage. We analyze the system's robustness against an active adversary who exploits publicly available data to impersonate legitimate users with fraudulent inputs. Our analysis focuses on characterizing the capacity region of the adversary's false acceptance exponent alongside the privacy leakage under reliability conditions. We further demonstrate that the achievable capacity region in the quantum domain surpasses that of classical systems. Additionally, we derive an optimal trade-off among the false acceptance exponent, public storage rate, and privacy leakage rate, offering key insights into the system's asymptotic performance.

International Conference on Communications•Jun 8, 2025•9 citations

Secret key generation and Storage based on QPUF

Kumar Nilesh, Christian Deppe, Holger Boche

Physically Unclonable Functions (PUFs) have emerged as critical primitives for secure authentication and key generation. However, classical PUFs are increasingly vulnerable to machine learning and quantum-enabled attacks. Quantum PUFs, leveraging the principles of quantum mechanics, provide a promising alternative offering information-theoretic security. In this work, we present an information-theoretic framework for two key applications of QPUFs: secret key generation and secure data storage. We rigorously characterize the trade-offs between achievable key and storage rates under various privacy leakage constraints—unconditional, conditional, and zero-leakage—extending classical results into the quantum domain. We derive single-letter capacity expressions based on Holevo information and analyze the impact of shared private randomness on achieving zero privacy leakage. Our results establish fundamental performance limits for QPUF-based security systems and lay the foundation for cryptographic key generation and storage protocols in future quantum-resilient communication infrastructures.

IEEE Information Theory Workshop (ITW)•Sep 29, 2025•7 citations

Secure Authentication via Quantum Physical Unclonable Functions: A Review

Pol Juliá Farré, Vladlen Galetsky, Mohamed Belhassen +6 more

ABSTRACT Quantum Physical Unclonable Functions (QPUFs) offer a physically grounded approach to secure authentication, extending the capabilities of classical PUFs. This review covers their theoretical foundations and key implementation challenges—such as quantum memories and Haar‐randomness—, and distinguishes QPUFs from Quantum Readout PUFs (QR‐PUFs), more experimentally accessible yet less robust against quantum‐capable adversaries. A co‐citation‐based selection method is employed to trace the evolution of QPUF architectures, from early QR‐PUFs to more recent Hybrid PUFs (HPUFs). This method further supports a discussion on the role of information‐theoretic analysis in mitigating inconsistencies in QPUF responses, underscoring the deep connection between secret‐key generation and authentication. Despite notable advances, achieving practical and robust QPUF‐based authentication remains an open challenge.

arXiv:2508.09296•Advanced Quantum Technologies•Jan 1, 2026•12 citations

Secure Storage For Identification Using Fully Quantum PUF

Kumar Nilesh, Christian Deppe, Marc Geitz +1 more

We present an information-theoretic framework for secure storage and message identification utilizing fully quantum physically unclonable functions (QPUFs). Extending prior models rooted in classical and hybrid classical-quantum PUFs, we propose a fully quantum setting that enables robust identification protocols in the presence of a powerful quantum wiretapper holding correlated side information. We derive achievable second-order identification rates under stringent privacy leakage constraints and show that secure identification is feasible whenever a positive secret key rate can be extracted from the QPUF output—establishing a quantum analogue of the classical dichotomy theorem. Furthermore, we demonstrate that augmenting the system with an auxiliary public quantum source enhances identification capacity without increasing privacy leakage. Our results provide a rigorous theoretical foundation for quantum-secure identification and storage, with implications for next-generation communication systems and adversarial environments requiring low-latency, energy-efficient quantum-secure storage protocols.

Globecom•Dec 8, 2025•3 citations

Information Theoretic Analysis of a Quantum PUF

Kumar Nilesh, Christian Deppe, Holger Boche

An information-theoretic model is presented for a general quantum physically unclonable function (QPUF) that generates a bipartite classical-quantum output. We first define achievable secret key rate versus privacy leakage rate pairs featuring perfect secrecy and uniform distribution of the secret key. To analyze the secret key generation from this QPUF model, we focus on two cases: first, without any constraints on the storage of public information, i.e., the helper data, and second, with rate constraints on it. This, in turn, provides a solution for the case of privacy leakage constraint. We calculate the maximum secret key that a QPUF can generate and derive the capacity region corresponding to this definition of achievability.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•13 citations
Quantum Physically Unclonable Functions (QPUFs) and quantum biometric responses offer provably secure authentication primitives whose unclonability is grounded in the laws of quantum mechanics. However, in practicality, the same physical source is often reused across multiple, mutually untrusted systems, raising fundamental questions about privacy leakage, key independence, and long-term security. We have developed a unified information-theoretic framework for reusable QPUF and quantum biometric-based authentication. Reliability, secrecy, inter-system key independence, and privacy leakage are formalized to study two realistic design paradigms: the joint design model and the legacy-compatible incremental design model. For classical–quantum enrollment, single-letter characterizations of the achievable key rate–privacy regions are derived, and explicit coding schemes attaining the bounds are provided. For fully quantum enrollment, multi-letter characterizations are obtained, reflecting the necessity of collective quantum operations. These results are then extended to secret key binding protocols. Our results rigorously quantify the cost of reusability and establish fundamental limits for scalable, privacy-preserving quantum authentication systems.
The fundamental information-theoretic limits of secure identification and authentication protocols that leverage Quantum Physical Unclonable Functions (QPUFs) and Quantum Biometrics are established in this paper. A unified theoretical framework is developed for enrollment-based identification systems with key generation that encompasses both QPUF-based device fingerprinting and quantum biometric modalities. This framework extends classical models of identification and key generation to both classical-quantum (c-q) and quantum-quantum (q-q) settings. The primary contribution of this work is the derivation of the complete, single-letter capacity region for the c-q model, which characterizes the ultimate trade-offs between the identification rate, secret-key rate, privacy-leakage rate, and public-storage rate. Furthermore, we establish a tight achievable region for the more general q-q model, quantifying the potential performance gains achievable with coherent quantum correlations. These results are also shown to hold for secret-key binding protocols, demonstrating an equivalence between key generation and secure storage. These findings provide comprehensive information-theoretic foundations for the design and analysis of secure, scalable, and privacy-preserving identification systems.
An information-theoretic analysis of secure authentication based on Quantum Physically Unclonable Functions (QPUF) is presented in this paper. The proposed model employs a secret key generated through QPUF to authenticate pre-enrolled user and device identities while maintaining secrecy and limiting privacy leakage. We analyze the system's robustness against an active adversary who exploits publicly available data to impersonate legitimate users with fraudulent inputs. Our analysis focuses on characterizing the capacity region of the adversary's false acceptance exponent alongside the privacy leakage under reliability conditions. We further demonstrate that the achievable capacity region in the quantum domain surpasses that of classical systems. Additionally, we derive an optimal trade-off among the false acceptance exponent, public storage rate, and privacy leakage rate, offering key insights into the system's asymptotic performance.
Physically Unclonable Functions (PUFs) have emerged as critical primitives for secure authentication and key generation. However, classical PUFs are increasingly vulnerable to machine learning and quantum-enabled attacks. Quantum PUFs, leveraging the principles of quantum mechanics, provide a promising alternative offering information-theoretic security. In this work, we present an information-theoretic framework for two key applications of QPUFs: secret key generation and secure data storage. We rigorously characterize the trade-offs between achievable key and storage rates under various privacy leakage constraints—unconditional, conditional, and zero-leakage—extending classical results into the quantum domain. We derive single-letter capacity expressions based on Holevo information and analyze the impact of shared private randomness on achieving zero privacy leakage. Our results establish fundamental performance limits for QPUF-based security systems and lay the foundation for cryptographic key generation and storage protocols in future quantum-resilient communication infrastructures.
ABSTRACT Quantum Physical Unclonable Functions (QPUFs) offer a physically grounded approach to secure authentication, extending the capabilities of classical PUFs. This review covers their theoretical foundations and key implementation challenges—such as quantum memories and Haar‐randomness—, and distinguishes QPUFs from Quantum Readout PUFs (QR‐PUFs), more experimentally accessible yet less robust against quantum‐capable adversaries. A co‐citation‐based selection method is employed to trace the evolution of QPUF architectures, from early QR‐PUFs to more recent Hybrid PUFs (HPUFs). This method further supports a discussion on the role of information‐theoretic analysis in mitigating inconsistencies in QPUF responses, underscoring the deep connection between secret‐key generation and authentication. Despite notable advances, achieving practical and robust QPUF‐based authentication remains an open challenge.
We present an information-theoretic framework for secure storage and message identification utilizing fully quantum physically unclonable functions (QPUFs). Extending prior models rooted in classical and hybrid classical-quantum PUFs, we propose a fully quantum setting that enables robust identification protocols in the presence of a powerful quantum wiretapper holding correlated side information. We derive achievable second-order identification rates under stringent privacy leakage constraints and show that secure identification is feasible whenever a positive secret key rate can be extracted from the QPUF output—establishing a quantum analogue of the classical dichotomy theorem. Furthermore, we demonstrate that augmenting the system with an auxiliary public quantum source enhances identification capacity without increasing privacy leakage. Our results provide a rigorous theoretical foundation for quantum-secure identification and storage, with implications for next-generation communication systems and adversarial environments requiring low-latency, energy-efficient quantum-secure storage protocols.
An information-theoretic model is presented for a general quantum physically unclonable function (QPUF) that generates a bipartite classical-quantum output. We first define achievable secret key rate versus privacy leakage rate pairs featuring perfect secrecy and uniform distribution of the secret key. To analyze the secret key generation from this QPUF model, we focus on two cases: first, without any constraints on the storage of public information, i.e., the helper data, and second, with rate constraints on it. This, in turn, provides a solution for the case of privacy leakage constraint. We calculate the maximum secret key that a QPUF can generate and derive the capacity region corresponding to this definition of achievability.