On the Scaling of Machine Learning Attacks on PUFs with Application to Noise Bifurcation View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2015

AUTHORS

Johannes Tobisch , Georg T. Becker

ABSTRACT

Physical Unclonable Functions (PUFs) are seen as a promising alternative to traditional cryptographic algorithms for secure and lightweight device authentication. However, most strong PUF proposals can be attacked using machine learning algorithms in which a precise software model of the PUF is determined. One of the most popular strong PUFs is the XOR Arbiter PUF. In this paper, we examine the machine learning resistance of the XOR Arbiter PUF by replicating the attack by Rührmaier et al.from CCS 2010. Using a more efficient implementation we are able to confirm the predicted exponential increase in needed number of responses for increasing XORs. However, our results show that the machine learning performance does not only depend on the PUF design and and the number of used response bits, but also on the specific PUF instance under attack. This is an important observation for machine learning attacks on PUFs in general. This instance-dependent behavior makes it difficult to determine precise lower bounds of the required number of challenge and response pairs (CRPs) and hence such numbers should always be treated with caution. Furthermore, we examine a machine learning countermeasure called noise bifurcation that was recently introduced at HOST 2014. In noise bifurcation, the machine learning resistance of XOR Arbiter PUFs is increased at the cost of using more responses during the authentication process. However, we show that noise bifurcation has a much smaller impact on the machine learning resistance than the results from HOST 2014 suggest. More... »

PAGES

17-31

References to SciGraph publications

Book

TITLE

Radio Frequency Identification. Security and Privacy Issues

ISBN

978-3-319-24836-3
978-3-319-24837-0

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-24837-0_2

DOI

http://dx.doi.org/10.1007/978-3-319-24837-0_2

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1031187331


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "name": [
            "Horst G\u00f6rtz Institute for IT Security, Ruhr-University Bochum"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tobisch", 
        "givenName": "Johannes", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "Horst G\u00f6rtz Institute for IT Security, Ruhr-University Bochum"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Becker", 
        "givenName": "Georg T.", 
        "id": "sg:person.015334303200.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015334303200.02"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-3-642-32946-3_27", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003891198", 
          "https://doi.org/10.1007/978-3-642-32946-3_27"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/586110.586132", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008003460"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-662-44709-3_25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009267794", 
          "https://doi.org/10.1007/978-3-662-44709-3_25"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/cpe.805", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037358670"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1866307.1866335", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046822949"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tifs.2013.2279798", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061630206"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/iccad.2008.4681648", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093388681"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sp.2011.10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094085458"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/csac.2002.1176287", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094340953"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/spw.2012.30", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094701269"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2015", 
    "datePublishedReg": "2015-01-01", 
    "description": "Physical Unclonable Functions (PUFs) are seen as a promising alternative to traditional cryptographic algorithms for secure and lightweight device authentication. However, most strong PUF proposals can be attacked using machine learning algorithms in which a precise software model of the PUF is determined. One of the most popular strong PUFs is the XOR Arbiter PUF. In this paper, we examine the machine learning resistance of the XOR Arbiter PUF by replicating the attack by R\u00fchrmaier\u00a0et al.from CCS 2010. Using a more efficient implementation we are able to confirm the predicted exponential increase in needed number of responses for increasing XORs. However, our results show that the machine learning performance does not only depend on the PUF design and and the number of used response bits, but also on the specific PUF instance under attack. This is an important observation for machine learning attacks on PUFs in general. This instance-dependent behavior makes it difficult to determine precise lower bounds of the required number of challenge and response pairs (CRPs) and hence such numbers should always be treated with caution. Furthermore, we examine a machine learning countermeasure called noise bifurcation that was recently introduced at HOST 2014. In noise bifurcation, the machine learning resistance of XOR Arbiter PUFs is increased at the cost of using more responses during the authentication process. However, we show that noise bifurcation has a much smaller impact on the machine learning resistance than the results from HOST 2014 suggest.", 
    "editor": [
      {
        "familyName": "Mangard", 
        "givenName": "Stefan", 
        "type": "Person"
      }, 
      {
        "familyName": "Schaumont", 
        "givenName": "Patrick", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-24837-0_2", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-24836-3", 
        "978-3-319-24837-0"
      ], 
      "name": "Radio Frequency Identification. Security and Privacy Issues", 
      "type": "Book"
    }, 
    "name": "On the Scaling of Machine Learning Attacks on PUFs with Application to Noise Bifurcation", 
    "pagination": "17-31", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-24837-0_2"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "9492ead2f9d41aa72dfcb740c6f34f2169c399ff3447ffd9018acf3ca3e46778"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1031187331"
        ]
      }
    ], 
    "publisher": {
      "location": "Cham", 
      "name": "Springer International Publishing", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-24837-0_2", 
      "https://app.dimensions.ai/details/publication/pub.1031187331"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T00:49", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8700_00000262.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-319-24837-0_2"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-24837-0_2'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-24837-0_2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-24837-0_2'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-24837-0_2'


 

This table displays all metadata directly associated to this object as RDF triples.

109 TRIPLES      23 PREDICATES      37 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-24837-0_2 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N78675f48101343cea7fd7d81249c8410
4 schema:citation sg:pub.10.1007/978-3-642-32946-3_27
5 sg:pub.10.1007/978-3-662-44709-3_25
6 https://doi.org/10.1002/cpe.805
7 https://doi.org/10.1109/csac.2002.1176287
8 https://doi.org/10.1109/iccad.2008.4681648
9 https://doi.org/10.1109/sp.2011.10
10 https://doi.org/10.1109/spw.2012.30
11 https://doi.org/10.1109/tifs.2013.2279798
12 https://doi.org/10.1145/1866307.1866335
13 https://doi.org/10.1145/586110.586132
14 schema:datePublished 2015
15 schema:datePublishedReg 2015-01-01
16 schema:description Physical Unclonable Functions (PUFs) are seen as a promising alternative to traditional cryptographic algorithms for secure and lightweight device authentication. However, most strong PUF proposals can be attacked using machine learning algorithms in which a precise software model of the PUF is determined. One of the most popular strong PUFs is the XOR Arbiter PUF. In this paper, we examine the machine learning resistance of the XOR Arbiter PUF by replicating the attack by Rührmaier et al.from CCS 2010. Using a more efficient implementation we are able to confirm the predicted exponential increase in needed number of responses for increasing XORs. However, our results show that the machine learning performance does not only depend on the PUF design and and the number of used response bits, but also on the specific PUF instance under attack. This is an important observation for machine learning attacks on PUFs in general. This instance-dependent behavior makes it difficult to determine precise lower bounds of the required number of challenge and response pairs (CRPs) and hence such numbers should always be treated with caution. Furthermore, we examine a machine learning countermeasure called noise bifurcation that was recently introduced at HOST 2014. In noise bifurcation, the machine learning resistance of XOR Arbiter PUFs is increased at the cost of using more responses during the authentication process. However, we show that noise bifurcation has a much smaller impact on the machine learning resistance than the results from HOST 2014 suggest.
17 schema:editor N19912c0cd2d943e181baca5e8e39769d
18 schema:genre chapter
19 schema:inLanguage en
20 schema:isAccessibleForFree false
21 schema:isPartOf Nd35dcd168c7a46ec97e3a7577a09d786
22 schema:name On the Scaling of Machine Learning Attacks on PUFs with Application to Noise Bifurcation
23 schema:pagination 17-31
24 schema:productId N7a361771525e45babeec6dd47b3704ba
25 Nbb531c279bf64f9a96a0320a17c74937
26 Nc1f9a3c65b9041e397776178b512c10d
27 schema:publisher N18cf898abf4f414e94a0ccf313043382
28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031187331
29 https://doi.org/10.1007/978-3-319-24837-0_2
30 schema:sdDatePublished 2019-04-16T00:49
31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
32 schema:sdPublisher N92f32e4d998b4383a59c39d548e6e521
33 schema:url http://link.springer.com/10.1007/978-3-319-24837-0_2
34 sgo:license sg:explorer/license/
35 sgo:sdDataset chapters
36 rdf:type schema:Chapter
37 N097315acd958486588a3d394aebe634d schema:affiliation N5e15ec72df054c05807fa806c8c9589e
38 schema:familyName Tobisch
39 schema:givenName Johannes
40 rdf:type schema:Person
41 N18cf898abf4f414e94a0ccf313043382 schema:location Cham
42 schema:name Springer International Publishing
43 rdf:type schema:Organisation
44 N19912c0cd2d943e181baca5e8e39769d rdf:first Nd780367fa12a4adc8fc35d28fb5fbfca
45 rdf:rest Nac97c6663f3c4294855d33f52a8014cd
46 N5e15ec72df054c05807fa806c8c9589e schema:name Horst Görtz Institute for IT Security, Ruhr-University Bochum
47 rdf:type schema:Organization
48 N6ca81d866b614ebda639371a350ed7b2 schema:name Horst Görtz Institute for IT Security, Ruhr-University Bochum
49 rdf:type schema:Organization
50 N78675f48101343cea7fd7d81249c8410 rdf:first N097315acd958486588a3d394aebe634d
51 rdf:rest Naba67a298092422c9dc3ee094e62e451
52 N7a361771525e45babeec6dd47b3704ba schema:name dimensions_id
53 schema:value pub.1031187331
54 rdf:type schema:PropertyValue
55 N92f32e4d998b4383a59c39d548e6e521 schema:name Springer Nature - SN SciGraph project
56 rdf:type schema:Organization
57 Naab2e69d3c9c4c1db50f694186d7f607 schema:familyName Schaumont
58 schema:givenName Patrick
59 rdf:type schema:Person
60 Naba67a298092422c9dc3ee094e62e451 rdf:first sg:person.015334303200.02
61 rdf:rest rdf:nil
62 Nac97c6663f3c4294855d33f52a8014cd rdf:first Naab2e69d3c9c4c1db50f694186d7f607
63 rdf:rest rdf:nil
64 Nbb531c279bf64f9a96a0320a17c74937 schema:name readcube_id
65 schema:value 9492ead2f9d41aa72dfcb740c6f34f2169c399ff3447ffd9018acf3ca3e46778
66 rdf:type schema:PropertyValue
67 Nc1f9a3c65b9041e397776178b512c10d schema:name doi
68 schema:value 10.1007/978-3-319-24837-0_2
69 rdf:type schema:PropertyValue
70 Nd35dcd168c7a46ec97e3a7577a09d786 schema:isbn 978-3-319-24836-3
71 978-3-319-24837-0
72 schema:name Radio Frequency Identification. Security and Privacy Issues
73 rdf:type schema:Book
74 Nd780367fa12a4adc8fc35d28fb5fbfca schema:familyName Mangard
75 schema:givenName Stefan
76 rdf:type schema:Person
77 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
78 schema:name Information and Computing Sciences
79 rdf:type schema:DefinedTerm
80 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
81 schema:name Artificial Intelligence and Image Processing
82 rdf:type schema:DefinedTerm
83 sg:person.015334303200.02 schema:affiliation N6ca81d866b614ebda639371a350ed7b2
84 schema:familyName Becker
85 schema:givenName Georg T.
86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015334303200.02
87 rdf:type schema:Person
88 sg:pub.10.1007/978-3-642-32946-3_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003891198
89 https://doi.org/10.1007/978-3-642-32946-3_27
90 rdf:type schema:CreativeWork
91 sg:pub.10.1007/978-3-662-44709-3_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009267794
92 https://doi.org/10.1007/978-3-662-44709-3_25
93 rdf:type schema:CreativeWork
94 https://doi.org/10.1002/cpe.805 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037358670
95 rdf:type schema:CreativeWork
96 https://doi.org/10.1109/csac.2002.1176287 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094340953
97 rdf:type schema:CreativeWork
98 https://doi.org/10.1109/iccad.2008.4681648 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093388681
99 rdf:type schema:CreativeWork
100 https://doi.org/10.1109/sp.2011.10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094085458
101 rdf:type schema:CreativeWork
102 https://doi.org/10.1109/spw.2012.30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094701269
103 rdf:type schema:CreativeWork
104 https://doi.org/10.1109/tifs.2013.2279798 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061630206
105 rdf:type schema:CreativeWork
106 https://doi.org/10.1145/1866307.1866335 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046822949
107 rdf:type schema:CreativeWork
108 https://doi.org/10.1145/586110.586132 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008003460
109 rdf:type schema:CreativeWork
 




Preview window. Press ESC to close (or click here)


...