Physical Unclonable Functions (PUF) for IoT Devices
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Physical Unclonable Function (PUF) has recently attracted interest from both industry and academia as a potential alternative approach to secure Internet of Things (IoT) devices from the more traditional computational-based approach using conventional cryptography. PUF is a promising solution for lightweight security, where the manufacturing fluctuation process of IC is used to improve the security of IoT as it provides low complexity design and preserves secrecy. PUF provides a low-cost low-power solution and can be implemented in both Field Programmable Gate Arrays (FPGA) and Application-Specific Integrated Circuits (ASICs). In this survey, we provide a comprehensive review of the state-of-the-art of PUF, its architectures, protocols and security for IoT.
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
Strukov, D. B., Snider, G. S., Stewart, D. R., & Williams, R. S. (2008) · Nature · doi:10.1038/nature06932 · Cited by 11,828
Memristor—The Missing Circuit Element
Chua, L. (1971) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1971.1083337 · Cited by 10,268 · cited 2×
“Memristor (refer to memory resistor) is first proposed in 1971 by Chua [48], which provides a relation between charge and flux.”
BackgroundAlgorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406
A Survey of Hardware Trojan Taxonomy and Detection
Tehranipoor, M., & Koushanfar, F. (2010) · IEEE Design & Test of Computers · doi:10.1109/mdt.2010.7 · Cited by 1,424
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 · cited 3×
“Ref PUF Architectures ML models Prediction Rate (%) Training Time CRPs Bit Length [112] Arbiter PUF LRa 95 0.”
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
- Al-Meer, A., & Al-Kuwari, S.
- Venue
- ACM Computing Surveys
- Published
- 2023-07-17
- Volume
- 55
- Issue
- 14s
- Pages
- 1-31
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W4362716538
- Cited by
- 176
- References
- 7
- FWCI
- 36.83
- 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
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.