On the learnability of physically unclonable functions / Fatemeh Ganji.
2018
Q325.5
Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Cite
Citation
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
On the learnability of physically unclonable functions / Fatemeh Ganji.
Author
ISBN
9783319767178 (electronic book)
3319767178 (electronic book)
9783319767161
331976716X
3319767178 (electronic book)
9783319767161
331976716X
Published
Cham, Switzerland : Springer, 2018.
Language
English
Description
1 online resource (xxiv, 86 pages) : illustrations.
Item Number
10.1007/978-3-319-76717-8 doi
Call Number
Q325.5
Dewey Decimal Classification
006.3/1
Summary
This book addresses the issue of Machine Learning (ML) attacks on Integrated Circuits through Physical Unclonable Functions (PUFs). It provides the mathematical proofs of the vulnerability of various PUF families, including Arbiter, XOR Arbiter, ring-oscillator, and bistable ring PUFs, to ML attacks. To achieve this goal, it develops a generic framework for the assessment of these PUFs based on two main approaches. First, with regard to the inherent physical characteristics, it establishes fit-for-purpose mathematical representations of the PUFs mentioned above, which adequately reflect the physical behavior of these primitives. To this end, notions and formalizations that are already familiar to the ML theory world are reintroduced in order to give a better understanding of why, how, and to what extent ML attacks against PUFs can be feasible in practice. Second, the book explores polynomial time ML algorithms, which can learn the PUFs under the appropriate representation. More importantly, in contrast to previous ML approaches, the framework presented here ensures not only the accuracy of the model mimicking the behavior of the PUF, but also the delivery of such a model. Besides off-the-shelf ML algorithms, the book applies a set of algorithms hailing from the field of property testing, which can help to evaluate the security of PUFs. They serve as a “toolbox”, from which PUF designers and manufacturers can choose the indicators most relevant for their requirements. Last but not least, on the basis of learning theory concepts, the book explicitly states that the PUF families cannot be considered as an ultimate solution to the problem of insecure ICs. As such, it provides essential insights into both academic research on and the design and manufacturing of PUFs.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed March 28, 2018).
Series
T-labs series in telecommunication services.
Available in Other Form
Print version: 9783319767161
Linked Resources
Record Appears in
Table of Contents
Introduction
Definitions and Preliminaries
PAC Learning of Arbiter PUFs
PAC Learning of XOR Arbiter PUFs
PAC Learning of Ring Oscillator PUFs
PAC Learning of Bistable Ring PUFs
Follow-up
Conclusion.
Definitions and Preliminaries
PAC Learning of Arbiter PUFs
PAC Learning of XOR Arbiter PUFs
PAC Learning of Ring Oscillator PUFs
PAC Learning of Bistable Ring PUFs
Follow-up
Conclusion.