The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Controlled physical random functions
Abstract
A physical random function (PUF) is a random function that can only be evaluated with the help of a complex physical system. We introduce controlled physical random functions (CPUFs) which are PUFs that can only be accessed via an algorithm that is physically bound to the PUF in an inseparable way. CPUFs can be used to establish a shared secret between a physical device and a remote user. We present protocols that make this possible in a secure and flexible way, even in the case of multiple mutually mistrusting parties. Once established, the shared secret can be used to enable a wide range of applications. We describe certified execution, where a certificate is produced that proves that a specific computation was carried out on a specific processor. Certified execution has many benefits, including protection against malicious nodes in distributed computation networks. We also briefly discuss a software licensing application.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Pappu, R., Recht, B., Taylor, J., & Gershenfeld, N. (2002) · Science · doi:10.1126/science.1074376 · Cited by 2,018
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
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
Self-citationArchitectural support for copy and tamper resistant software
Thekkath, D. L. C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., & Horowitz, M. (2000) · ACM SIGARCH Computer Architecture News · doi:10.1145/378995.379237 · Cited by 597
Security Engineering: A Guide to Building Dependable Distributed Systems
Anderson, R. (2020) · doi:10.1002/9781119644682 · Cited by 345
Building a high-performance, programmable secure coprocessor
Smith, S. W., & Weingart, S. (1999) · Computer Networks · doi:10.1016/s1389-1286(98)00019-x · Cited by 336
Yee, B. (1994) · Cited by 220
Architectural support for copy and tamper resistant software
Lie, D., Thekkath, C. A., Codesourcery, M. M., Lincoln, P. D., Boneh, D., Mitchell, J. C., & Horowitz, M. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357005 · Cited by 132
Cited by
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-citationSilicon 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
Self-citationModeling attacks on physical unclonable functions
Rührmair, U., Sehnke, F., Sölter, J., Dror, G., Devadas, S., & Schmidhuber, J. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866335 · Cited by 1,021
Self-citation
Metadata
- Authors
- Gassend, B., Clarke, D., van Dijk, M., & Devadas, S.
- Venue
- 18th Annual Computer Security Applications Conference, 2002. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-26
- Pages
- 149-160
- ISSN
- 1063-9527 (ISSN-L)
- OpenAlex
- W2172255798
- Cited by
- 380
- References
- 10
- FWCI
- 6.14
- 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
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.