Let me prove it to you: RO PUFs are provably learnable

DOI10.1007/978-3-319-30840-1_22zbMATH Open1474.68036OpenAlexW2503140022MaRDI QIDQ2806778FDOQ2806778

Authors: Fatemeh Ganji, Shahin Tajik, Jean-Pierre Seifert 

Publication date: 19 May 2016

Published in: Information Security and Cryptology - ICISC 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30840-1_22

Recommendations

• Strong machine learning attack against PUFs with no mathematical model
• A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
• Protecting ring oscillator physical unclonable functions against modeling attacks
• Foundations of reconfigurable PUFs
• The gap between promise and reality: on the insecurity of XOR arbiter PUFs

zbMATH Keywords

machine learningPAC learningdecision listsphysically unclonable functionsRO PUFs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Computer security (68M25)

Cited In (5)

• Foundations of reconfigurable PUFs
• Photonic side-channel analysis of arbiter PUFs
• Protecting ring oscillator physical unclonable functions against modeling attacks
• Improved ring oscillator PUF: an FPGA-friendly secure primitive
• Strong machine learning attack against PUFs with no mathematical model

This page was built for publication: Let me prove it to you: RO PUFs are provably learnable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806778)