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 Conference on Computer Communications Workshops (INFOCOM WKSHPS)

Robust authentication and data storage with perfect secrecy

Sebastian Baur, Holger Boche

Published May 1, 2017• 6 citations
Publisher

Abstract

We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region corresponding to weak secrecy. We define achievability requiring a small false acceptance probability and show that the corresponding capacity region is the same. We generalize our result for perfect secrecy to the case of a compound source. We also discuss the problem of secure data storage using data from a PUF when the statistics of the PUF are not perfectly known.

DOI
10.1109/infcomw.2017.8116437

Related papers

Robust Secure Authentication and Data Storage with Perfect Secrecy

Sebastian Baur, Holger Boche

We consider an authentication process that makes use of biometric data or the output of a physical unclonable function (PUF), respectively, from an information theoretical point of view. We analyse different definitions of achievability for the authentication model. For the secrecy of the key generated for authentication, these definitions differ in their requirements. In the first work on PUF based authentication, weak secrecy has been used and the corresponding capacity regions have been characterized. The disadvantages of weak secrecy are well known. The ultimate performance criteria for the key are perfect secrecy together with uniform distribution of the key. We derive the corresponding capacity region. We show that, for perfect secrecy and uniform distribution of the key, we can achieve the same rates as for weak secrecy together with a weaker requirement on the distribution of the key. In the classical works on PUF based authentication, it is assumed that the source statistics are known perfectly. This requirement is rarely met in applications. That is why the model is generalized to a compound model, taking into account source uncertainty. We also derive the capacity region for the compound model requiring perfect secrecy. Additionally, we consider results for secure storage using a biometric or PUF source that follow directly from the results for authentication. We also generalize known results for this problem by weakening the assumption concerning the distribution of the data that shall be stored. This allows us to combine source compression and secure storage.

Cryptography•Apr 10, 2018•8 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

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

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

Secret-Key Generation with PUFs and Biometric Identifiers for Compound Authentication Channels

Vamoua Yachongka, Rémi A. Chou

In this study, we investigate the fundamental limits of secret-key generation with physical identifiers for compound authentication channels. Our contributions in this paper are the derivations of inner and outer bounds on the optimal tradeoff of secret-key, storage, and privacy-leakage rates for general discrete sources, and we show that these bounds are tight for Gaussian sources. In special cases, our characterizations reduce to existing results derived in previous works.

IEEE Information Theory Workshop (ITW)•Nov 24, 2024•2 citations
We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region corresponding to weak secrecy. We define achievability requiring a small false acceptance probability and show that the corresponding capacity region is the same. We generalize our result for perfect secrecy to the case of a compound source. We also discuss the problem of secure data storage using data from a PUF when the statistics of the PUF are not perfectly known.
We consider an authentication process that makes use of biometric data or the output of a physical unclonable function (PUF), respectively, from an information theoretical point of view. We analyse different definitions of achievability for the authentication model. For the secrecy of the key generated for authentication, these definitions differ in their requirements. In the first work on PUF based authentication, weak secrecy has been used and the corresponding capacity regions have been characterized. The disadvantages of weak secrecy are well known. The ultimate performance criteria for the key are perfect secrecy together with uniform distribution of the key. We derive the corresponding capacity region. We show that, for perfect secrecy and uniform distribution of the key, we can achieve the same rates as for weak secrecy together with a weaker requirement on the distribution of the key. In the classical works on PUF based authentication, it is assumed that the source statistics are known perfectly. This requirement is rarely met in applications. That is why the model is generalized to a compound model, taking into account source uncertainty. We also derive the capacity region for the compound model requiring perfect secrecy. Additionally, we consider results for secure storage using a biometric or PUF source that follow directly from the results for authentication. We also generalize known results for this problem by weakening the assumption concerning the distribution of the data that shall be stored. This allows us to combine source compression and secure storage.
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.
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.
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.