國立虎尾科技大學 |

On the Learnability of Physically Unclonable Functions

Record Type:	Language materials, printed : Monograph/item
Title/Author:	On the Learnability of Physically Unclonable Functions/ by Fatemeh Ganji.
Author:	Ganji, Fatemeh.
Description:	XXIV, 86 p. 21 illus., 4 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computational intelligence. -
Online resource:	https://doi.org/10.1007/978-3-319-76717-8
ISBN:	9783319767178

On the Learnability of Physically Unclonable Functions
Ganji, Fatemeh.

On the Learnability of Physically Unclonable Functions[electronic resource] /by Fatemeh Ganji. - 1st ed. 2018. - XXIV, 86 p. 21 illus., 4 illus. in color.online resource. - T-Labs Series in Telecommunication Services,2192-2810. - T-Labs Series in Telecommunication Services,.

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.

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.

ISBN: 9783319767178

Standard No.: 10.1007/978-3-319-76717-8doiSubjects--Topical Terms:

568984
Computational intelligence.

LC Class. No.: Q342

Dewey Class. No.: 006.3

On the Learnability of Physically Unclonable Functions
LDR:03411nam a22004095i 4500 001 997286
003 DE-He213
005 20200702032648.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319767178 $9 978-3-319-76717-8
024 7 $a 10.1007/978-3-319-76717-8 $2 doi
035 $a 978-3-319-76717-8
050 4 $a Q342
072 7 $a UYQ $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
100 1 $a Ganji, Fatemeh. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1202314
245 1 0 $a On the Learnability of Physically Unclonable Functions $h [electronic resource] / $c by Fatemeh Ganji.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XXIV, 86 p. 21 illus., 4 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a T-Labs Series in Telecommunication Services, $x 2192-2810
505 0 $a 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.
520 $a 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.
650 0 $a Computational intelligence. $3 568984
650 0 $a Coding theory. $3 561460
650 0 $a Information theory. $3 595305
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer mathematics. $3 1199796
650 0 $a Electronic circuits. $3 563332
650 1 4 $a Computational Intelligence. $3 768837
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
650 2 4 $a Circuits and Systems. $3 670901
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319767161
776 0 8 $i Printed edition: $z 9783319767185
776 0 8 $i Printed edition: $z 9783030095635
830 0 $a T-Labs Series in Telecommunication Services, $x 2192-2810 $3 1254917
856 4 0 $u https://doi.org/10.1007/978-3-319-76717-8
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)