The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Lightweight secure PUFs
Abstract
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 principles: (i) inclusion of multiple delay lines for creation of each response bit; (ii) transformations and combination of the challenge bits; and (iii) combination of the outputs from multiple delay lines; to create modular, easy to parameterize, secure and reliable PUF structures. Statistical analysis of the new structure and its comparison with existing PUFs indicates a significantly lower predictability, and higher resilience against circuit faults, reverse engineering and other security attacks.
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
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
Silicon 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
FPGA 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
Lee, J. W., Lim, D., Gassend, B., Suh, G. E., van Dijk, M., & Devadas, S. (2004) · 2004 Symposium on VLSI Circuits. Digest of Technical Papers (IEEE Cat. No.04CH37525) · doi:10.1109/vlsic.2004.1346548 · Cited by 842
Security Engineering: A Guide to Building Dependable Distributed Systems
Anderson, R. (2020) · doi:10.1002/9781119644682 · Cited by 345
Identification and authentication of integrated circuits
Gassend, B., Lim, D., Clarke, D., van Dijk, M., & Devadas, S. (2004) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.805 · Cited by 306
Active hardware metering for intellectual property protection and security
Alkabani, Y., & Koushanfar, F. (2007) · USENIX Security Symposium · Cited by 302
Self-citationA Case Against Currently Used Hash Functions in RFID Protocols
Feldhofer, M., & Rechberger, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11915034_61 · Cited by 205
Physically Unclonable Function-Based Security and Privacy in RFID Systems
Bolotnyy, L., & Robins, G. (2007) · Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07) · doi:10.1109/percom.2007.26 · Cited by 196
Trimberger, S. (2007) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/1278480.1278483 · Cited by 80
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-citationIoT: Internet of Threats? A Survey of Practical Security Vulnerabilities in Real IoT Devices
Meneghello, F., Calore, M., Zucchetto, D., Polese, M., & Zanella, A. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2935189 · Cited by 799
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
The 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
- Majzoobi, M., Koushanfar, F., & Potkonjak, M.
- Venue
- 2008 IEEE/ACM International Conference on Computer-Aided Design
- Publisher
- IEEE
- Published
- 2008-11
- Pages
- 670-673
- OpenAlex
- W3147945423
- Cited by
- 273
- References
- 11
- FWCI
- 4.33
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Lightweight secure PUFs. https://app.cochat.ai/papers/10.1109/iccad.2008.4681648
- The paper
- Majzoobi, M., Koushanfar, F., & Potkonjak, M. (2008). Lightweight secure PUFs. 2008 IEEE/ACM International Conference on Computer-Aided Design. https://doi.org/10.1109/iccad.2008.4681648
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.