Towards Scalable Identification in RFID Systems View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2015-08-06

AUTHORS

Mete Akgün, Mehmet Ufuk Çaǧlayan

ABSTRACT

The search efficiency of radio frequency identification (RFID) protocols remains a challenging issue. There are many proposals that address the security and privacy issues of RFID, but most of them require reader work that is linear with the number of tags. Some proposals use a tree-based approach to solve the search efficiency problem. The tree-based approach reduces the search complexity from O(N)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}}(N)$$\end{document} to O(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}}(\log N)$$\end{document}. However, tree-based protocols are vulnerable to tag compromising attacks due to the lack of a key-updating mechanism. Therefore, tree-based protocols are weak private in Vaudenay’s privacy model. In this paper, we propose a privacy-preserving RFID authentication protocol that does not require lookup. Our solution is based on the use of physically unclonable functions (PUFs) and is destructive-private in the Vaudenay-Model. It provides resistance against tag compromising attack by using PUFs as a secure storage mechanism to preserve the privacy of the tag. More... »

PAGES

403-421

References to SciGraph publications

  • 2006. Reducing Time Complexity in RFID Systems in SELECTED AREAS IN CRYPTOGRAPHY
  • 2008. Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2009. PUF-Based Authentication Protocols – Revisited in INFORMATION SECURITY APPLICATIONS
  • 2007. Security with Noisy Data, On Private Biometrics, Secure Key Storage and Anti-Counterfeiting in NONE
  • 2007. On Privacy Models for RFID in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2007
  • 2009. A Highly Scalable RFID Authentication Protocol in INFORMATION SECURITY AND PRIVACY
  • 2006. RFID-Tags for Anti-counterfeiting in TOPICS IN CRYPTOLOGY – CT-RSA 2006
  • 2012. A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions in RFID. SECURITY AND PRIVACY
  • 2010. Time Measurement Threatens Privacy-Friendly RFID Authentication Protocols in RADIO FREQUENCY IDENTIFICATION: SECURITY AND PRIVACY ISSUES
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s11277-015-2936-7

    DOI

    http://dx.doi.org/10.1007/s11277-015-2936-7

    DIMENSIONS

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


    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/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "T\u00fcbitak UEKAE, 41470, Kocaeli, Turkey", 
              "id": "http://www.grid.ac/institutes/None", 
              "name": [
                "T\u00fcbitak UEKAE, 41470, Kocaeli, Turkey"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Akg\u00fcn", 
            "givenName": "Mete", 
            "id": "sg:person.0635104226.42", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0635104226.42"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Computer Engineering Department, Bo\u01e7azi\u00e7i University, Istanbul, Turkey", 
              "id": "http://www.grid.ac/institutes/grid.11220.30", 
              "name": [
                "Computer Engineering Department, Bo\u01e7azi\u00e7i University, Istanbul, Turkey"
              ], 
              "type": "Organization"
            }, 
            "familyName": "\u00c7a\u01e7layan", 
            "givenName": "Mehmet Ufuk", 
            "id": "sg:person.015011544465.26", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015011544465.26"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-76900-2_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045390035", 
              "https://doi.org/10.1007/978-3-540-76900-2_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-02620-1_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026147351", 
              "https://doi.org/10.1007/978-3-642-02620-1_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-84628-984-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031879288", 
              "https://doi.org/10.1007/978-1-84628-984-2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11605805_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017694985", 
              "https://doi.org/10.1007/11605805_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-25286-0_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009255874", 
              "https://doi.org/10.1007/978-3-642-25286-0_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-10838-9_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053476017", 
              "https://doi.org/10.1007/978-3-642-10838-9_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85855-3_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019247181", 
              "https://doi.org/10.1007/978-3-540-85855-3_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-16822-2_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032415214", 
              "https://doi.org/10.1007/978-3-642-16822-2_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11693383_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014939805", 
              "https://doi.org/10.1007/11693383_20"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2015-08-06", 
        "datePublishedReg": "2015-08-06", 
        "description": "The search efficiency of radio frequency identification (RFID) protocols remains a challenging issue. There are many proposals that address the security and privacy issues of RFID, but most of them require reader work that is linear with the number of tags. Some proposals use a tree-based approach to solve the search efficiency problem. The tree-based approach reduces the search complexity from O(N)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${\\mathcal {O}}(N)$$\\end{document} to O(logN)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${\\mathcal {O}}(\\log N)$$\\end{document}. However, tree-based protocols are vulnerable to tag compromising attacks due to the lack of a key-updating mechanism. Therefore, tree-based protocols are weak private in Vaudenay\u2019s privacy model. In this paper, we propose a privacy-preserving RFID authentication protocol that does not require lookup. Our solution is based on the use of physically unclonable functions (PUFs) and is destructive-private in the Vaudenay-Model. It provides resistance against tag compromising attack by using PUFs as a secure storage mechanism to preserve the privacy of the tag.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s11277-015-2936-7", 
        "inLanguage": "en", 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1052655", 
            "issn": [
              "0929-6212", 
              "1572-834X"
            ], 
            "name": "Wireless Personal Communications", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "86"
          }
        ], 
        "keywords": [
          "tree-based approach", 
          "tree-based protocols", 
          "privacy model", 
          "search efficiency problem", 
          "RFID authentication protocol", 
          "Vaudenay\u2019s privacy model", 
          "radio frequency identification (RFID) protocol", 
          "number of tags", 
          "authentication protocol", 
          "privacy issues", 
          "search complexity", 
          "scalable identification", 
          "RFID system", 
          "search efficiency", 
          "efficiency problem", 
          "Unclonable Functions", 
          "challenging issue", 
          "identification protocol", 
          "tags", 
          "attacks", 
          "protocol", 
          "privacy", 
          "RFID", 
          "security", 
          "storage mechanism", 
          "proposal", 
          "complexity", 
          "issues", 
          "PUF", 
          "reader work", 
          "system", 
          "efficiency", 
          "solution", 
          "work", 
          "model", 
          "number", 
          "use", 
          "identification", 
          "mechanism", 
          "lack", 
          "function", 
          "resistance", 
          "approach", 
          "paper", 
          "problem", 
          "frequency identification (RFID) protocols", 
          "key-updating mechanism", 
          "privacy-preserving RFID authentication protocol", 
          "Vaudenay-Model", 
          "secure storage mechanism"
        ], 
        "name": "Towards Scalable Identification in RFID Systems", 
        "pagination": "403-421", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1014387869"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s11277-015-2936-7"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s11277-015-2936-7", 
          "https://app.dimensions.ai/details/publication/pub.1014387869"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-12-01T19:35", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/article/article_681.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s11277-015-2936-7"
      }
    ]
     

    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/s11277-015-2936-7'

    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/s11277-015-2936-7'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s11277-015-2936-7'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s11277-015-2936-7'


     

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

    154 TRIPLES      22 PREDICATES      84 URIs      67 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s11277-015-2936-7 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author Nac6bf05f7c3f44debabef2cc836ed67f
    4 schema:citation sg:pub.10.1007/11605805_8
    5 sg:pub.10.1007/11693383_20
    6 sg:pub.10.1007/978-1-84628-984-2
    7 sg:pub.10.1007/978-3-540-76900-2_5
    8 sg:pub.10.1007/978-3-540-85855-3_6
    9 sg:pub.10.1007/978-3-642-02620-1_25
    10 sg:pub.10.1007/978-3-642-10838-9_22
    11 sg:pub.10.1007/978-3-642-16822-2_13
    12 sg:pub.10.1007/978-3-642-25286-0_6
    13 schema:datePublished 2015-08-06
    14 schema:datePublishedReg 2015-08-06
    15 schema:description The search efficiency of radio frequency identification (RFID) protocols remains a challenging issue. There are many proposals that address the security and privacy issues of RFID, but most of them require reader work that is linear with the number of tags. Some proposals use a tree-based approach to solve the search efficiency problem. The tree-based approach reduces the search complexity from O(N)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}}(N)$$\end{document} to O(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}}(\log N)$$\end{document}. However, tree-based protocols are vulnerable to tag compromising attacks due to the lack of a key-updating mechanism. Therefore, tree-based protocols are weak private in Vaudenay’s privacy model. In this paper, we propose a privacy-preserving RFID authentication protocol that does not require lookup. Our solution is based on the use of physically unclonable functions (PUFs) and is destructive-private in the Vaudenay-Model. It provides resistance against tag compromising attack by using PUFs as a secure storage mechanism to preserve the privacy of the tag.
    16 schema:genre article
    17 schema:inLanguage en
    18 schema:isAccessibleForFree false
    19 schema:isPartOf N316c654e5a79400f82929f510c43a8bf
    20 Nc1117ec56cfa4747b0d06ed5e922da07
    21 sg:journal.1052655
    22 schema:keywords PUF
    23 RFID
    24 RFID authentication protocol
    25 RFID system
    26 Unclonable Functions
    27 Vaudenay-Model
    28 Vaudenay’s privacy model
    29 approach
    30 attacks
    31 authentication protocol
    32 challenging issue
    33 complexity
    34 efficiency
    35 efficiency problem
    36 frequency identification (RFID) protocols
    37 function
    38 identification
    39 identification protocol
    40 issues
    41 key-updating mechanism
    42 lack
    43 mechanism
    44 model
    45 number
    46 number of tags
    47 paper
    48 privacy
    49 privacy issues
    50 privacy model
    51 privacy-preserving RFID authentication protocol
    52 problem
    53 proposal
    54 protocol
    55 radio frequency identification (RFID) protocol
    56 reader work
    57 resistance
    58 scalable identification
    59 search complexity
    60 search efficiency
    61 search efficiency problem
    62 secure storage mechanism
    63 security
    64 solution
    65 storage mechanism
    66 system
    67 tags
    68 tree-based approach
    69 tree-based protocols
    70 use
    71 work
    72 schema:name Towards Scalable Identification in RFID Systems
    73 schema:pagination 403-421
    74 schema:productId N693e7aa7dba24d93acdaeec1aa846639
    75 Nbd904e05f54b461ea84d4bcf81697e9e
    76 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014387869
    77 https://doi.org/10.1007/s11277-015-2936-7
    78 schema:sdDatePublished 2021-12-01T19:35
    79 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    80 schema:sdPublisher N4ccad1ba07934a27a45abdfda1e30ae1
    81 schema:url https://doi.org/10.1007/s11277-015-2936-7
    82 sgo:license sg:explorer/license/
    83 sgo:sdDataset articles
    84 rdf:type schema:ScholarlyArticle
    85 N316c654e5a79400f82929f510c43a8bf schema:volumeNumber 86
    86 rdf:type schema:PublicationVolume
    87 N4ccad1ba07934a27a45abdfda1e30ae1 schema:name Springer Nature - SN SciGraph project
    88 rdf:type schema:Organization
    89 N693e7aa7dba24d93acdaeec1aa846639 schema:name dimensions_id
    90 schema:value pub.1014387869
    91 rdf:type schema:PropertyValue
    92 N8e8f9748fa9144be8fd555f1d951bc85 rdf:first sg:person.015011544465.26
    93 rdf:rest rdf:nil
    94 Nac6bf05f7c3f44debabef2cc836ed67f rdf:first sg:person.0635104226.42
    95 rdf:rest N8e8f9748fa9144be8fd555f1d951bc85
    96 Nbd904e05f54b461ea84d4bcf81697e9e schema:name doi
    97 schema:value 10.1007/s11277-015-2936-7
    98 rdf:type schema:PropertyValue
    99 Nc1117ec56cfa4747b0d06ed5e922da07 schema:issueNumber 2
    100 rdf:type schema:PublicationIssue
    101 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    102 schema:name Information and Computing Sciences
    103 rdf:type schema:DefinedTerm
    104 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    105 schema:name Data Format
    106 rdf:type schema:DefinedTerm
    107 sg:journal.1052655 schema:issn 0929-6212
    108 1572-834X
    109 schema:name Wireless Personal Communications
    110 schema:publisher Springer Nature
    111 rdf:type schema:Periodical
    112 sg:person.015011544465.26 schema:affiliation grid-institutes:grid.11220.30
    113 schema:familyName Çaǧlayan
    114 schema:givenName Mehmet Ufuk
    115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015011544465.26
    116 rdf:type schema:Person
    117 sg:person.0635104226.42 schema:affiliation grid-institutes:None
    118 schema:familyName Akgün
    119 schema:givenName Mete
    120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0635104226.42
    121 rdf:type schema:Person
    122 sg:pub.10.1007/11605805_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017694985
    123 https://doi.org/10.1007/11605805_8
    124 rdf:type schema:CreativeWork
    125 sg:pub.10.1007/11693383_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014939805
    126 https://doi.org/10.1007/11693383_20
    127 rdf:type schema:CreativeWork
    128 sg:pub.10.1007/978-1-84628-984-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031879288
    129 https://doi.org/10.1007/978-1-84628-984-2
    130 rdf:type schema:CreativeWork
    131 sg:pub.10.1007/978-3-540-76900-2_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045390035
    132 https://doi.org/10.1007/978-3-540-76900-2_5
    133 rdf:type schema:CreativeWork
    134 sg:pub.10.1007/978-3-540-85855-3_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019247181
    135 https://doi.org/10.1007/978-3-540-85855-3_6
    136 rdf:type schema:CreativeWork
    137 sg:pub.10.1007/978-3-642-02620-1_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026147351
    138 https://doi.org/10.1007/978-3-642-02620-1_25
    139 rdf:type schema:CreativeWork
    140 sg:pub.10.1007/978-3-642-10838-9_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053476017
    141 https://doi.org/10.1007/978-3-642-10838-9_22
    142 rdf:type schema:CreativeWork
    143 sg:pub.10.1007/978-3-642-16822-2_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032415214
    144 https://doi.org/10.1007/978-3-642-16822-2_13
    145 rdf:type schema:CreativeWork
    146 sg:pub.10.1007/978-3-642-25286-0_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009255874
    147 https://doi.org/10.1007/978-3-642-25286-0_6
    148 rdf:type schema:CreativeWork
    149 grid-institutes:None schema:alternateName Tübitak UEKAE, 41470, Kocaeli, Turkey
    150 schema:name Tübitak UEKAE, 41470, Kocaeli, Turkey
    151 rdf:type schema:Organization
    152 grid-institutes:grid.11220.30 schema:alternateName Computer Engineering Department, Boǧaziçi University, Istanbul, Turkey
    153 schema:name Computer Engineering Department, Boǧaziçi University, Istanbul, Turkey
    154 rdf:type schema:Organization
     




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


    ...