2026-09-19T19:49:46Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1037292026-06-16T18:55:46Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Srinivas Devadas.
Herder, Charles H. (Charles Henry), III
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-07-18T20:04:40Z
2016-07-18T20:04:40Z
2016
2016
http://hdl.handle.net/1721.1/103729
953418830
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 243-260).
Physical Unclonable Functions (PUFs) are a promising new cryptographic primitive that leverage manufacturing variation to create unclonable secrets in embedded systems. In this case, the secret is no longer stored permanently in digital form, but rather as the physical properties of the manufactured chip. Further, the recent proposal of "Public Model Physical Unclonable Functions" (PPUFs) does not contain any secrets at all. Instead, PPUFs propose to use a constant-factor computational speedup to distinguish an unclonable hardware device from a digital simulation. This thesis presents a new computational fuzzy extractor and stateless PUF leveraging Learning Parity with Noise (LPN). This method significantly improves over the state-of-the-art in extracting stable secrets from PUFs and has a clear security reduction to a well-accepted cryptographic assumption (LPN). In addition, this dissertation proposes for the first time a formalism describing Public Model Physical Unclonable Functions based on ordinary differential equations (ODEs), a conjecture on the form of ODE integrators, and a formal reduction of PPUF security to this conjecture. This result is extended to compare analog and digital computing more generally. Finally, this thesis provides direction for implementing a PPUF.
by Charles Henry Herder III.
Ph.D.
260 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Towards security without secrets
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="592468d5-6a59-4915-84e0-3b2639c51712">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Towards security without secrets</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Herder, Charles H. (Charles Henry), III</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Physical Unclonable Functions (PUFs) are a promising new cryptographic primitive that leverage manufacturing variation to create unclonable secrets in embedded systems. In this case, the secret is no longer stored permanently in digital form, but rather as the physical properties of the manufactured chip. Further, the recent proposal of "Public Model Physical Unclonable Functions" (PPUFs) does not contain any secrets at all. Instead, PPUFs propose to use a constant-factor computational speedup to distinguish an unclonable hardware device from a digital simulation. This thesis presents a new computational fuzzy extractor and stateless PUF leveraging Learning Parity with Noise (LPN). This method significantly improves over the state-of-the-art in extracting stable secrets from PUFs and has a clear security reduction to a well-accepted cryptographic assumption (LPN). In addition, this dissertation proposes for the first time a formalism describing Public Model Physical Unclonable Functions based on ordinary differential equations (ODEs), a conjecture on the form of ODE integrators, and a formal reduction of PPUF security to this conjecture. This result is extended to compare analog and digital computing more generally. Finally, this thesis provides direction for implementing a PPUF.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>