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

International Journal of Quantum Information

SECURITY OF QUANTUM-READOUT PUFs AGAINST QUADRATURE-BASED CHALLENGE-ESTIMATION ATTACKS

Boris Škorić, Allard P. Mosk, Pepijn W. H. Pinkse

Published Jun 1, 2013• 25 citations
Publisher

Abstract

The concept of quantum-secure readout of Physical Unclonable Functions (PUFs) has recently been realized experimentally in an optical PUF system. We analyze the security of this system under the strongest type of classical attack: the challenge estimation attack. The adversary performs a measurement on the challenge quantum state in order to learn as much about it as he can. Using this knowledge, he then tries to reconstruct the challenge and to emulate the PUF. We consider quadrature measurements, which are the most informative practical measurements known to us. We prove that even under this attack the expected number of photons detected in the verification mechanism is approximately a factor S + 1 too low; here S is the Quantum Security Parameter, defined as the number of modes in the optical system divided by the number of photons in the challenge. The photon count allows for a reliable distinction between an authentic PUF and a challenge estimation attack.

DOI
10.1142/s021974991350041x

Related papers

Security analysis of Quantum-Readout PUFs in the case of challenge-estimation attacks

Boris Škorić

Quantum Readout (QR) of Physical Unclonable Functions (PUFs) is a new technique for remotely authenticating objects, which has recently been demonstrated experimentally. The security is based on basic quantum information theoretic principles and holds under the assumption that the adversary cannot clone or physically emulate PUFs. We analyse the security of QR under a class of attacks called ‘digital emulation’, in which the adversary first performs state estimation on the challenge and then bases his response on this estimate. We make use of a result by Bruß and Macchiavello to derive an upper bound on the adversary’s success probability as a function of the Hilbert space dimension K and the photon number n. We prove that QR is unconditionally secure against digital emulation attacks when the challenges are Fock states. For non-Fock-states we provide a security proof under the condition that the attacker’s measurements commute with the particle number operator.

Quantum Information and Computation•Jan 1, 2016•13 citations

Security analysis of Quantum-Readout PUFs in the case of generic challenge-estimation attacks.

Boris Škorić

Quantum Readout PUFs (QR-PUFs) have been proposed as a technique for remote authentication of ob jects. The security is based on basic quantum information theoretic principles and the assumption that the adversary cannot losslessly implement arbitrary unitary transformations on a K-dimensional state space, with K "large". We consider all possible attacks in which the adversary bases his response on challenge state estimation by measurements. We first analyze the security of QR-PUF schemes in the case where each challenge consists of precisely n identical quanta. We use a result by Bruss and Macchiavello to derive an upper bound on the adversary’s success probability as a function of K and n. Then we generalize to challenges that contain a probabilistic number of quanta, and in particular a Poisson distribution.

•Jan 1, 2013•1 citation

Quantum readout of Physical Unclonable Functions

Boris Škorić

Physical unclonable functions (PUFs) are physical structures that are hard to clone and have a unique challenge-response behavior. The term PUF was coined by Pappu et al. in 2001. That work triggered a lot of interest, and since then a substantial number of papers has been written about the use of a wide variety of physical structures for different security purposes such as identification, authentication, read-proof key storage, key distribution, tamper evidence, anti-counterfeiting, software-to-hardware binding and trusted computing. In this paper we propose a new security primitive: the quantum-readout PUF (QR-PUF). This is a classical PUF, without internal quantum degrees of freedom, which is challenged using a quantum state, e.g. a single-photon state, and whose response is also a quantum state. By the no-cloning property of unknown quantum states, attackers cannot intercept challenges or responses without noticeably disturbing the readout process. Thus, a verifier who sends quantum states as challenges and receives the correct quantum states back can be certain that he is probing a specific QR-PUF without disturbances, even if the QR-PUF is far away "in the field" and under hostile control. For PUFs whose information content is not exceedingly large, all currently known PUF-based authentication and anti-counterfeiting schemes require trusted readout devices in the field. Our quantum readout scheme has no such requirement. Furthermore, we show how the QR-PUF authentication scheme can be interwoven with quantum key exchange (QKE), leading to an authenticated QKE protocol between two parties. This protocol has the special property that it requires no a priori secret shared by the two parties, and that the quantum channel is the authenticated channel, allowing for an unauthenticated classical channel. We provide security proofs for a limited class of attacks. The proofs depend on the physical unclonability of PUFs and on the practical infeasibility of building a quantum computer.

International Journal of Quantum Information•Feb 1, 2012•63 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

Quantum-Secure Physical Unclonable Function enabled by Silicon Photonics Integrated Circuits

G. Sarantoglou, N. Tzekas, G. Moustakas +8 more

Physical Unclonable Functions (PUFs) are hardware security primitives whose inherent physical complexity can be exploited for secure authentication and cryptographic key generation. Silicon photonic devices, owing to their suitability for quantum and artificial intelligence applications alongside standard CMOS fabrication processes, constitute a highly promising substrate for integrated multifunctional PUFs. Despite the advanced security guarantees offered by quantum cryptographic protocols and the central role of silicon photonics in quantum technologies, quantum readout strategies based on single-photon states for photonic PUFs remain largely unexplored. In this work, we experimentally demonstrate a silicon nitride (SiN) programmable photonic Mach Zehnder interferometer mesh that implements a unitary transformation and operates as a PUF, whose secret physical signature arises from uncontrollable waveguide variations during fabrication. Using experimentally derived parameters from the SiN integrated mesh, we further introduce and numerically evaluate a quantum readout protocol that combines single-photon states with PUFs. Maximally mixed quantum states are employed to conceal the underlying unitary transformation from passive eavesdropping. Security against adversaries possessing devices fabricated under similar conditions is assessed, with authentication performance quantified through Monte Carlo analysis of the false acceptance and false rejection rates as a function of the number of detected events and corrected errors. The results indicate exceptional performance with equal error rates as low as 10 to the minus 14, highlighting the potential of quantum secure PUFs for high security authentication applications.

physics.opticsCross-listedarXiv:2605.14959•May 15, 2026•1 citation

Security assessment of photonic integrated circuit-based physically unclonable functions

Hans Kieninger, Paul Jimenez, Fabio Pavanello +4 more

Physically unclonable functions (PUFs) have emerged as a promising hardware security primitive, and recent years have seen growing interest in realizing PUFs on photonic integrated circuits (PICs). We classify existing PIC-based PUFs into electrically configured and optically encoded designs. Notably, security properties remain insufficiently analyzed, with mathematical unclonability often assumed without supporting argument. To illustrate this issue, we introduce a modeling attack against the subclass of optically encoded PUFs that operate in a linear optical regime. We show that, for a representative simulated PUF construction, observing as few as 200 challenge-response pairs allows learning the challenge-response mapping. Under canonical modeling assumptions, linear optically encoded PUFs are therefore mathematically clonable, calling for a careful assessment of their suitability for authentication protocols that rely on mathematical unclonability.

Optics Express•Jun 25, 2026•0 citations
The concept of quantum-secure readout of Physical Unclonable Functions (PUFs) has recently been realized experimentally in an optical PUF system. We analyze the security of this system under the strongest type of classical attack: the challenge estimation attack. The adversary performs a measurement on the challenge quantum state in order to learn as much about it as he can. Using this knowledge, he then tries to reconstruct the challenge and to emulate the PUF. We consider quadrature measurements, which are the most informative practical measurements known to us. We prove that even under this attack the expected number of photons detected in the verification mechanism is approximately a factor S + 1 too low; here S is the Quantum Security Parameter, defined as the number of modes in the optical system divided by the number of photons in the challenge. The photon count allows for a reliable distinction between an authentic PUF and a challenge estimation attack.
Quantum Readout (QR) of Physical Unclonable Functions (PUFs) is a new technique for remotely authenticating objects, which has recently been demonstrated experimentally. The security is based on basic quantum information theoretic principles and holds under the assumption that the adversary cannot clone or physically emulate PUFs. We analyse the security of QR under a class of attacks called ‘digital emulation’, in which the adversary first performs state estimation on the challenge and then bases his response on this estimate. We make use of a result by Bruß and Macchiavello to derive an upper bound on the adversary’s success probability as a function of the Hilbert space dimension K and the photon number n. We prove that QR is unconditionally secure against digital emulation attacks when the challenges are Fock states. For non-Fock-states we provide a security proof under the condition that the attacker’s measurements commute with the particle number operator.
Quantum Readout PUFs (QR-PUFs) have been proposed as a technique for remote authentication of ob jects. The security is based on basic quantum information theoretic principles and the assumption that the adversary cannot losslessly implement arbitrary unitary transformations on a K-dimensional state space, with K "large". We consider all possible attacks in which the adversary bases his response on challenge state estimation by measurements. We first analyze the security of QR-PUF schemes in the case where each challenge consists of precisely n identical quanta. We use a result by Bruss and Macchiavello to derive an upper bound on the adversary’s success probability as a function of K and n. Then we generalize to challenges that contain a probabilistic number of quanta, and in particular a Poisson distribution.
Physical unclonable functions (PUFs) are physical structures that are hard to clone and have a unique challenge-response behavior. The term PUF was coined by Pappu et al. in 2001. That work triggered a lot of interest, and since then a substantial number of papers has been written about the use of a wide variety of physical structures for different security purposes such as identification, authentication, read-proof key storage, key distribution, tamper evidence, anti-counterfeiting, software-to-hardware binding and trusted computing. In this paper we propose a new security primitive: the quantum-readout PUF (QR-PUF). This is a classical PUF, without internal quantum degrees of freedom, which is challenged using a quantum state, e.g. a single-photon state, and whose response is also a quantum state. By the no-cloning property of unknown quantum states, attackers cannot intercept challenges or responses without noticeably disturbing the readout process. Thus, a verifier who sends quantum states as challenges and receives the correct quantum states back can be certain that he is probing a specific QR-PUF without disturbances, even if the QR-PUF is far away "in the field" and under hostile control. For PUFs whose information content is not exceedingly large, all currently known PUF-based authentication and anti-counterfeiting schemes require trusted readout devices in the field. Our quantum readout scheme has no such requirement. Furthermore, we show how the QR-PUF authentication scheme can be interwoven with quantum key exchange (QKE), leading to an authenticated QKE protocol between two parties. This protocol has the special property that it requires no a priori secret shared by the two parties, and that the quantum channel is the authenticated channel, allowing for an unauthenticated classical channel. We provide security proofs for a limited class of attacks. The proofs depend on the physical unclonability of PUFs and on the practical infeasibility of building a quantum computer.
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) are hardware security primitives whose inherent physical complexity can be exploited for secure authentication and cryptographic key generation. Silicon photonic devices, owing to their suitability for quantum and artificial intelligence applications alongside standard CMOS fabrication processes, constitute a highly promising substrate for integrated multifunctional PUFs. Despite the advanced security guarantees offered by quantum cryptographic protocols and the central role of silicon photonics in quantum technologies, quantum readout strategies based on single-photon states for photonic PUFs remain largely unexplored. In this work, we experimentally demonstrate a silicon nitride (SiN) programmable photonic Mach Zehnder interferometer mesh that implements a unitary transformation and operates as a PUF, whose secret physical signature arises from uncontrollable waveguide variations during fabrication. Using experimentally derived parameters from the SiN integrated mesh, we further introduce and numerically evaluate a quantum readout protocol that combines single-photon states with PUFs. Maximally mixed quantum states are employed to conceal the underlying unitary transformation from passive eavesdropping. Security against adversaries possessing devices fabricated under similar conditions is assessed, with authentication performance quantified through Monte Carlo analysis of the false acceptance and false rejection rates as a function of the number of detected events and corrected errors. The results indicate exceptional performance with equal error rates as low as 10 to the minus 14, highlighting the potential of quantum secure PUFs for high security authentication applications.
Physically unclonable functions (PUFs) have emerged as a promising hardware security primitive, and recent years have seen growing interest in realizing PUFs on photonic integrated circuits (PICs). We classify existing PIC-based PUFs into electrically configured and optically encoded designs. Notably, security properties remain insufficiently analyzed, with mathematical unclonability often assumed without supporting argument. To illustrate this issue, we introduce a modeling attack against the subclass of optically encoded PUFs that operate in a linear optical regime. We show that, for a representative simulated PUF construction, observing as few as 200 challenge-response pairs allows learning the challenge-response mapping. Under canonical modeling assumptions, linear optically encoded PUFs are therefore mathematically clonable, calling for a careful assessment of their suitability for authentication protocols that rely on mathematical unclonability.