The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Robust and Reverse-Engineering Resilient PUF Authentication and Key-Exchange by Substring Matching
Open accessAbstract
This paper proposes novel robust and low-overhead physical unclonable function (PUF) authentication and key exchange protocols that are resilient against reverse-engineering attacks. The protocols are executed between a party with access to a physical PUF (prover) and a trusted party who has access to the PUF compact model (verifier). The proposed protocols do not follow the classic paradigm of exposing the full PUF responses or a transformation of them. Instead, random subsets of the PUF response strings are sent to the verifier so the exact position of the subset is obfuscated for the third-party channel observers. Authentication of the responses at the verifier side is done by matching the substring to the available full response string; the index of the matching point is the actual obfuscated secret (or key) and not the response substring itself. We perform a thorough analysis of resiliency of the protocols against various adversarial acts, including machine learning and statistical attacks. The attack analysis guides us in tuning the parameters of the protocol for an efficient and secure implementation. The low overhead and practicality of the protocols are evaluated and confirmed by hardware implementation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
PUF Modeling Attacks on Simulated and Silicon Data
Ruhrmair, U., Solter, J., Sehnke, F., Xu, X., Mahmoud, A., Stoyanova, V., Dror, G., Schmidhuber, J., Burleson, W., & Devadas, S. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2279798 · Cited by 637
Self-citation
Cited by
Physical Unclonable Functions and Applications: A Tutorial
Herder, C., Yu, M.-D., Koushanfar, F., & Devadas, S. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2320516 · Cited by 1,357
Self-citationA Primer on Hardware Security: Models, Methods, and Metrics
Rostami, M., Koushanfar, F., & Karri, R. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2335155 · Cited by 658
Self-citationThe Gap Between Promise and Reality: On the Insecurity of XOR Arbiter PUFs
Becker, G. T. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48324-4_27 · Cited by 254
Metadata
- Authors
- Rostami, M., Majzoobi, M., Koushanfar, F., Wallach, D. S., & Devadas, S.
- Venue
- IEEE Transactions on Emerging Topics in Computing
- Published
- 2014-03
- Volume
- 2
- Issue
- 1
- Pages
- 37-49
- ISSN
- 2168-6750 (ISSN-L)
- 2376-4562
- OpenAlex
- W2126279347
- Cited by
- 171
- References
- 1
- FWCI
- 25.24
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Robust and Reverse-Engineering Resilient PUF Authentication and Key-Exchange by Substring Matching. https://app.cochat.ai/papers/10.1109/tetc.2014.2300635
- The paper
- Rostami, M., Majzoobi, M., Koushanfar, F., Wallach, D. S., & Devadas, S. (2014). Robust and Reverse-Engineering Resilient PUF Authentication and Key-Exchange by Substring Matching. IEEE Transactions on Emerging Topics in Computing. https://doi.org/10.1109/tetc.2014.2300635
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.