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)

Quantum PUF Based Secret Key Generation and Secure Storage with Side Information

Kumar Nilesh, Christian Deppe, Holger Boche

Published Jun 22, 2025• 7 citations
Publisher

Abstract

This work introduces a Quantum PUF (QPUF)-based approach to enhance cryptographic key generation and secure storage. An information-theoretic model is developed to analyze trade-offs between key generation, secure storage, and privacy leakage under unconditional and conditional secrecy constraints. Additionally, the use of shared private keys is explored to achieve zero privacy leakage. The results extend classical and classical-quantum findings to the fully quantum regime, to provide a pathway toward robust authentication and data security and offering a foundation for next-generation hardware security.

DOI
10.1109/isit63088.2025.11195487

Related papers

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

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

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

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

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 PUF and its Applications with Information Theoretic Analysis

Kumar Nilesh, Christian Deppe, Holger Boche

Physical Unclonable Functions (PUFs) have garnered significant attention for their potential in enhancing the security of IoT devices, offering an alternative to traditional computational-based approaches. Despite their potential, classical PUFs suffer from critical drawbacks, including vulnerability to machine learning attacks and inadequate defense against quantum adversaries. To address these limitations, alternative architectures utilizing quantum mechanical principles, known as Quantum PUFs (QPUFs), have been proposed. This paper presents a comprehensive survey of the diverse range of QPUFs, detailing their architectures and security features. Additionally, it explores the information-theoretic applications of QPUFs in IoT, including secret key generation, secure storage, authentication, and identification. The findings indicate that classical results translate effectively to the quantum domain in most cases, with QPUFs exhibiting larger capacity regions compared to their classical counterparts.

IEEE World Forum on Internet of Things (WF-IoT)•Nov 10, 2024•12 citations
This work introduces a Quantum PUF (QPUF)-based approach to enhance cryptographic key generation and secure storage. An information-theoretic model is developed to analyze trade-offs between key generation, secure storage, and privacy leakage under unconditional and conditional secrecy constraints. Additionally, the use of shared private keys is explored to achieve zero privacy leakage. The results extend classical and classical-quantum findings to the fully quantum regime, to provide a pathway toward robust authentication and data security and offering a foundation for next-generation hardware security.
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.
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.
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.
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 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.
Physical Unclonable Functions (PUFs) have garnered significant attention for their potential in enhancing the security of IoT devices, offering an alternative to traditional computational-based approaches. Despite their potential, classical PUFs suffer from critical drawbacks, including vulnerability to machine learning attacks and inadequate defense against quantum adversaries. To address these limitations, alternative architectures utilizing quantum mechanical principles, known as Quantum PUFs (QPUFs), have been proposed. This paper presents a comprehensive survey of the diverse range of QPUFs, detailing their architectures and security features. Additionally, it explores the information-theoretic applications of QPUFs in IoT, including secret key generation, secure storage, authentication, and identification. The findings indicate that classical results translate effectively to the quantum domain in most cases, with QPUFs exhibiting larger capacity regions compared to their classical counterparts.