PUF modeling attacks: An introduction and overview

@article{Rhrmair2014PUFMA,
  title={PUF modeling attacks: An introduction and overview},
  author={Ulrich R{\"u}hrmair and Jan S{\"o}lter},
  journal={2014 Design, Automation \& Test in Europe Conference \& Exhibition (DATE)},
  year={2014},
  pages={1-6}
}
  • U. Rührmair, J. Sölter
  • Published 24 March 2014
  • Computer Science
  • 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Machine learning (ML) based modeling attacks are the currently most relevant and effective attack form for so-called Strong Physical Unclonable Functions (Strong PUFs). We provide an overview of this method in this paper: We discuss (i) the basic conditions under which it is applicable; (ii) the ML algorithms that have been used in this context; (iii) the latest and most advanced results; (iv) the right interpretation of existing results; and (v) possible future research directions. 

Tables from this paper

Machine Learning based Modeling Attacks on a Configurable PUF
  • Sharad Kumar, M. Niamat
  • Computer Science, Mathematics
    NAECON 2018 - IEEE National Aerospace and Electronics Conference
  • 2018
TLDR
This paper examines the resistance of a strong configurable RO-PUF design controlled by Programmable XOR gates (PXOR) towards machine learning based modeling attacks.
A Machine Learning Attacks Resistant Two Stage Physical Unclonable Functions Design
TLDR
A combination of a 32-bit current mirror and 16-bit arbiter PUFs in 65nm CMOS technology is proposed to improve resilience against modelling attacks.
Countering PUF Modeling Attacks through Adversarial Machine Learning
TLDR
An effective countermeasure against modeling attacks is proposed by employing adversarial machine learning techniques that introduce errors (poison) to the adversary’s model.
Effect of Aging on PUF Modeling Attacks based on Power Side-Channel Observations
TLDR
This paper shows that aging has a significant impact on modeling attacks, and shows that the ML attack via power traces is particularly efficient to recover the responses of the anti-modeling VTC PUF, yet aging still contributes to enhance its security.
PUFs at a glance
TLDR
This paper provides a brief and easily accessible overview of the typical security features, implementations, attacks, protocols uses, and applications of Physical Unclonable Functions.
Splitting the Interpose PUF: A Novel Modeling Attack Strategy
We demonstrate that the Interpose PUF proposed at CHES 2019, an Arbiter PUF-based design for so-called Strong Physical Unclonable Functions (PUFs), can be modeled by novel machine learning strategies
A Novel Modeling-Attack Resilient Arbiter-PUF Design
TLDR
A modeling-resilient arbiter-PUF architecture that benefits from the randomness provided by PUFs in concealing the obfuscation scheme is proposed and the experimental results confirm the effectiveness of the proposed structure in countering PUF modeling attacks.
Special session: How secure are PUFs really? On the reach and limits of recent PUF attacks
TLDR
This paper provides a short and easily accessible overview of the session at DATE 2014, and addresses the question of how strong and relevant are these attacks, and how secure are PUFs really.
Security Analysis of Machine Learning-Based PUF Enrollment Protocols: A Review
TLDR
This paper identifies two architectures of enrollment protocols based on the participating entities and the building blocks that are relevant to the security of the authentication procedure and provides design guidelines for future enrollment protocol designers.
Lightweight obfuscation techniques for modeling attacks resistant PUFs
TLDR
This study proposes an obfuscation technique during post-processing of Strong-PUF responses to increase the resilience against machine learning attacks and finds that it reduces the predictability of the 32-bit Arbiter- PUF to less than 70% and more reduction in predictability has been observed in an XOR Arbiters'PUF.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 65 REFERENCES
Hybrid side-channel/machine-learning attacks on PUFs: A new threat?
  • Xiaolin Xu, W. Burleson
  • Computer Science, Mathematics
    2014 Design, Automation & Test in Europe Conference & Exhibition (DATE)
  • 2014
TLDR
This work presents an overview and survey of side-channel attacks on Physical Unclonable Functions, as well as of classical side channel techniques for PUFs, and proposes a taxonomy based on the characteristics of different side- channel attacks.
Combined Modeling and Side Channel Attacks on Strong PUFs
TLDR
The combination of machine-learning based modeling techniques with side channel information allows us to attack so-called XOR Arbiter PUFs and Lightweight PUFs up to a size and complexity that was previously out of reach.
PUFs at a glance
TLDR
This paper provides a brief and easily accessible overview of the typical security features, implementations, attacks, protocols uses, and applications of Physical Unclonable Functions.
Modeling attacks on physical unclonable functions
TLDR
It is shown in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks, based upon various machine learning techniques including Logistic Regression and Evolution Strategies.
Lightweight secure PUFs
To ensure security and robustness of the next generation of Physically Unclonable Functions (PUFs), we have developed a new methodology for PUF design. Our approach employs integration of three key
Side channel modeling attacks on 65nm arbiter PUFs exploiting CMOS device noise
TLDR
This paper exploits repeatability imperfections of PUF responses as a side channel for model building and demonstrates that 65nm CMOS arbiter PUFs can be modeled successfully, without utilizing any ML algorithm.
The Bistable Ring PUF: A new architecture for strong Physical Unclonable Functions
TLDR
This paper introduces a new architecture for circuit-based Physical Unclonable Functions (PUFs) which it is argued that this new PUF could be a promising candidate for Strong PUFs.
Physical Unclonable Functions in Cryptographic Protocols: Security Proofs and Impossibility Results
TLDR
New PUF definitions that require only weak average security properties of the PUF are provided, and it is proved that these definitions suffice to realize secure PUF-based oblivious transfer (OT), bit com mitment (BC) and key exchange (KE) in said setting.
On the Foundations of Physical Unclonable Functions
TLDR
A comparative analysis between the existing definitions of Physical Unclonable Functions and new notions is provided, by classifying existing PUF implementations with respect to them, and the outcome is that the definitions seem to match the current PUF landscape well, perhaps better than previous definitions.
Applications of High-Capacity Crossbar Memories in Cryptography
TLDR
This paper proposes a new approach for the construction of highly secure physical unclonable functions (PUFs) that allows the first PUFs that are secure against computationally unrestricted adversaries, and which remain so in the face of weeks or even years of uninterrupted adversarial access.
...
1
2
3
4
5
...