A Lockdown Technique to Prevent Machine Learning on PUFs for Lightweight Authentication
Open accessThe DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Pattern Recognition and Machine Learning
Neal, R. M. (2007) · Technometrics · doi:10.1198/tech.2007.s518 · Cited by 4,571
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Physical unclonable functions for device authentication and secret key generation
Suh, G. E., & Devadas, S. (2007) · Proceedings of the 44th annual conference on Design automation - DAC '07 · doi:10.1145/1278480.1278484 · Cited by 2,065
Self-citationLearnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839 · cited 1×
“This same work also declared certain k-XOR PUF constructs as not PAC-learnable; they cannot be learned with a polynomial number of CRPs and in polynomial time, provided that the Vapnik-Chervonenkis (VC) dimension [39] of a k-XOR n-stage PUF is linear to (n + 1).”
BackgroundSilicon physical random functions
Gassend, B., Clarke, D., van Dijk, M., & Devadas, S. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586132 · Cited by 1,660
Self-citationFPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
Extracting secret keys from integrated circuits
Lim, D., Lee, J. W., Gassend, B., Suh, G. E., van Dijk, M., & Devadas, S. (2005) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2005.859470 · Cited by 1,047 · cited 1×
“Machine learning attacks on strong PUFs were proposed in [19], [20] and certain constructs broken in [14], [17], [18], [21], [22], [23].”
BackgroundSelf-citation
Cited by
Gao, Y., Al-Sarawi, S. F., & Abbott, D. (2020) · Nature Electronics · doi:10.1038/s41928-020-0372-5 · Cited by 613
PUF Based Authentication Protocol for IoT
Braeken, A. (2018) · Symmetry · doi:10.3390/sym10080352 · Cited by 178
“In the lightweight category of proposals are the Slender PUF, [14] noise bifurcation [15] and PUF lockdown protocol [16] retained, while in the non-lightweight category only Reference protocol II-A [13] and the protocol proposed by Sadegi et al. [17].”
BackgroundMethodPhysical Unclonable Functions in the Internet of Things: State of the Art and Open Challenges
Babaei, A., & Schiele, G. (2019) · Sensors · doi:10.3390/s19143208 · Cited by 168
Metadata
- Authors
- Yu, M.-D., Hiller, M., Delvaux, J., Sowell, R., Devadas, S., & Verbauwhede, I.
- Venue
- IEEE Transactions on Multi-Scale Computing Systems
- Published
- 2016-07-01
- Volume
- 2
- Issue
- 3
- Pages
- 146-159
- ISSN
- 2332-7766 (ISSN-L)
- 2372-207X
- OpenAlex
- W2321234954
- Cited by
- 191
- References
- 40
- FWCI
- 27.33
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Lockdown Technique to Prevent Machine Learning on PUFs for Lightweight Authentication. https://app.cochat.ai/papers/10.1109/tmscs.2016.2553027
- The paper
- Yu, M.-D., Hiller, M., Delvaux, J., Sowell, R., Devadas, S., & Verbauwhede, I. (2016). A Lockdown Technique to Prevent Machine Learning on PUFs for Lightweight Authentication. IEEE Transactions on Multi-Scale Computing Systems. https://doi.org/10.1109/tmscs.2016.2553027
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.