Set-based Obfuscation for Strong PUFs against Machine Learning Attacks
Jiliang Zhang, Chaoqun Shen

TL;DR
This paper introduces a set-based obfuscation method for strong PUFs that effectively resists machine learning attacks with minimal hardware overhead, maintaining high security even against extensive CRP collection.
Contribution
The proposed Random Set-based Obfuscation (RSO) method enhances PUF security by dynamically updating response sets and obfuscating challenges, significantly reducing attack success rates.
Findings
Prediction accuracy drops to ~50% under attack
RSO maintains security with low hardware overhead
Effective against various machine learning models
Abstract
Strong physical unclonable function (PUF) is a promising solution for device authentication in resourceconstrained applications but vulnerable to machine learning attacks. In order to resist such attack, many defenses have been proposed in recent years. However, these defenses incur high hardware overhead, degenerate reliability and are inefficient against advanced machine learning attacks such as approximation attacks. In order to address these issues, we propose a Random Set-based Obfuscation (RSO) for Strong PUFs to resist machine learning attacks. The basic idea is that several stable responses are derived from the PUF itself and pre-stored as the set for obfuscation in the testing phase, and then a true random number generator is used to select any two keys to obfuscate challenges and responses with XOR operations. When the number of challenge-response pairs (CRPs) collected by the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhysical Unclonable Functions (PUFs) and Hardware Security · Integrated Circuits and Semiconductor Failure Analysis · Neuroscience and Neural Engineering
