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.
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.
Physical Unclonable Functions (PUFs) have emerged as a powerful cryptographic tool for various applications due to their inherent physical uniqueness and unclonability. However, the advent of quantum computers has posed significant threats to classical PUFs. In response, Quantum PUFs (QPUFs), which exploit the principles of quantum mechanics, have been introduced as a robust alternative. This paper analyzes two key applications of QPUFs utilizing their distinctive output: secure storage and identification, from an information theoretic perspective. We establish achievability under different constraints and derive the secure storage capacity and a doubly exponential identification rate, even in the presence of an active adversary attempting to deceive the system by exploiting publicly stored data. We further demonstrate that within the quantum domain, we achieve higher rates compared to classical counterparts.
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.
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.
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.
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.