A Lockdown Technique to Prevent Machine Learning on PUFs for Lightweight Authentication

• Published in: IEEE transactions on multi-scale computing systems Vol. 2; no. 3; pp. 146 - 159
• Main Authors: Yu, Meng-Day, Hiller, Matthias, Delvaux, Jeroen, Sowell, Richard, Devadas, Srinivas, Verbauwhede, Ingrid
• Format: Journal Article
• Language: English
• Published: IEEE 01.07.2016
• Subjects: Authentication; computationally unrestricted adversary; Cryptography; heuristic security; machine learning; Manufacturing; Physical unclonable function; probably approximately correct (PAC) learning; Protocols; Servers; Silicon
• ISSN: 2332-7766; 2332-7766
• DOI: 10.1109/TMSCS.2016.2553027

We present a lightweight PUF-based authentication approach that is practical in settings where a server authenticates a device, and for use cases where the number of authentications is limited over a device's lifetime. Our scheme uses a server-managed challenge/response pair (CRP) lockdown protocol: unlike prior approaches, an adaptive chosen-challenge adversary with machine learning capabilities cannot obtain new CRPs without the server's implicit permission. The adversary is faced with the problem of deriving a PUF model with a limited amount of machine learning training data. Our system-level approach allows a so-called strong PUF to be used for lightweight authentication in a manner that is heuristically secure against today's best machine learning methods through a worst-case CRP exposure algorithmic validation. We also present a degenerate instantiation using a weak PUF that is secure against computationally unrestricted adversaries, which includes any learning adversary, for practical device lifetimes and read-out rates. We validate our approach using silicon PUF data, and demonstrate the feasibility of supporting 10, 1,000, and 1M authentications, including practical configurations that are not learnable with polynomial resources, e.g., the number of CRPs and the attack runtime, using recent results based on the probably-approximately-correct (PAC) complexity-theoretic framework.