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

Lecture notes in computer science

Robust Key Extraction from Physical Uncloneable Functions

Boris Škorić, Pim Tuyls, W. Ophey

Published Jan 1, 2005• 141 citations
Publisher
DOI
10.1007/11496137_28

Related papers

Secret key generation from classical physics : Physical Uncloneable Functions (Chapter 6.4)

PT Tuyls, Boris Škorić

Ambient Intelligence•Jan 1, 2006•1 citation

Secure Authentication via Quantum Physical Unclonable Functions: A Review

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

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.

•Jan 29, 2026•0 citations

Information-Theoretic Security Analysis of Physical Uncloneable Functions

Pim Tuyls, Boris Škorić, Sjoerd Stallinga +2 more

Lecture notes in computer science•Jan 1, 2005•88 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•6 citations

Oblivious Transfer Based on Physical Unclonable Functions

Ulrich Rührmair

Lecture notes in computer science•Jan 1, 2010•70 citations

Physical Unclonable Functions based on random gratings

Frédéric Monet, Anthony Roberge, Raman Kashyap

Physical Unclonable Functions (PUFs) are hardware-based unique and irreproducible keys that can be used for authentication and encryption. We show that robustly secure PUFs can be easily manufactured by inscribing random gratings in optical fibers.

Optica Advanced Photonics Congress•Jan 1, 2022•0 citations
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.