Parallel and Concurrent Security of the HB and HB+ Protocols View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2010-02-17

AUTHORS

Jonathan Katz, Ji Sun Shin, Adam Smith

ABSTRACT

Hopper and Blum (Asiacrypt 2001) and Juels and Weis (Crypto 2005) recently proposed two shared-key authentication protocols—HB and HB+, respectively—whose extremely low computational cost makes them attractive for low-cost devices such as radio-frequency identification (RFID) tags. The security of these protocols is based on the conjectured hardness of the “learning parity with noise” (LPN) problem, which is equivalent to the problem of decoding random binary linear codes. The HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks. More... »

PAGES

402-421

References to SciGraph publications

  • 2005. Authenticating Pervasive Devices with Human Protocols in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 1995. On the security of some cryptosystems based on error-correcting codes in ADVANCES IN CRYPTOLOGY — EUROCRYPT'94
  • 2006. An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication in PROGRESS IN CRYPTOLOGY - INDOCRYPT 2006
  • 2008-01-01. : Increasing the Security and Efficiency of in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 1994. Cryptographic Primitives Based on Hard Learning Problems in ADVANCES IN CRYPTOLOGY — CRYPTO’ 93
  • 2006. Parallel and Concurrent Security of the HB and HB + Protocols in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2006
  • 2005. Hardness Amplification of Weakly Verifiable Puzzles in THEORY OF CRYPTOGRAPHY
  • 2006. An Improved LPN Algorithm in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2001-11-20. Secure Human Identification Protocols in ADVANCES IN CRYPTOLOGY — ASIACRYPT 2001
  • 1994-12. Definitions and properties of zero-knowledge proof systems in JOURNAL OF CRYPTOLOGY
  • 2008. Good Variants of HB + Are Hard to Find in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2005. The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00145-010-9061-2

    DOI

    http://dx.doi.org/10.1007/s00145-010-9061-2

    DIMENSIONS

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


    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": "Dept. of Computer Science, University of Maryland, College Park, USA", 
              "id": "http://www.grid.ac/institutes/grid.410443.6", 
              "name": [
                "Dept. of Computer Science, University of Maryland, College Park, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Katz", 
            "givenName": "Jonathan", 
            "id": "sg:person.01354261156.67", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Dept. of Computer Science, University of Maryland, College Park, USA", 
              "id": "http://www.grid.ac/institutes/grid.410443.6", 
              "name": [
                "Dept. of Computer Science, University of Maryland, College Park, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Shin", 
            "givenName": "Ji Sun", 
            "id": "sg:person.015326027245.79", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015326027245.79"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Dept. of Computer Science and Engineering, The Pennsylvania State University, University Park, USA", 
              "id": "http://www.grid.ac/institutes/grid.29857.31", 
              "name": [
                "Dept. of Computer Science and Engineering, The Pennsylvania State University, University Park, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Smith", 
            "givenName": "Adam", 
            "id": "sg:person.013307226666.21", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-45682-1_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027730722", 
              "https://doi.org/10.1007/3-540-45682-1_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11832072_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009973045", 
              "https://doi.org/10.1007/11832072_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11535218_18", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048110650", 
              "https://doi.org/10.1007/11535218_18"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-30576-7_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047370291", 
              "https://doi.org/10.1007/978-3-540-30576-7_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-85230-8_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000904993", 
              "https://doi.org/10.1007/978-3-540-85230-8_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11941378_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033812388", 
              "https://doi.org/10.1007/11941378_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-78967-3_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028765794", 
              "https://doi.org/10.1007/978-3-540-78967-3_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0053430", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045273682", 
              "https://doi.org/10.1007/bfb0053430"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11538462_32", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022279726", 
              "https://doi.org/10.1007/11538462_32"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf00195207", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051079135", 
              "https://doi.org/10.1007/bf00195207"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48329-2_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045214757", 
              "https://doi.org/10.1007/3-540-48329-2_24"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11761679_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037494651", 
              "https://doi.org/10.1007/11761679_6"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2010-02-17", 
        "datePublishedReg": "2010-02-17", 
        "description": "Hopper and Blum (Asiacrypt 2001) and Juels and Weis (Crypto 2005) recently proposed two shared-key authentication protocols\u2014HB and HB+, respectively\u2014whose extremely low computational cost makes them attractive for low-cost devices such as radio-frequency identification (RFID) tags. The security of these protocols is based on the conjectured hardness of the \u201clearning parity with noise\u201d (LPN) problem, which is equivalent to the problem of decoding random binary linear codes. The HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s00145-010-9061-2", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.3084991", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": [
          {
            "id": "sg:journal.1136278", 
            "issn": [
              "0933-2790", 
              "1432-1378"
            ], 
            "name": "Journal of Cryptology", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "23"
          }
        ], 
        "keywords": [
          "random binary linear codes", 
          "radio frequency identification (RFID) tags", 
          "low computational cost", 
          "active attacks", 
          "concurrent security", 
          "Learning Parity", 
          "passive adversary", 
          "HB protocol", 
          "low-cost devices", 
          "computational cost", 
          "conjectured hardness", 
          "binary linear codes", 
          "linear codes", 
          "security", 
          "identification tags", 
          "protocol", 
          "Juels", 
          "adversary", 
          "attacks", 
          "code", 
          "tags", 
          "Blum", 
          "cost", 
          "devices", 
          "noise", 
          "Wei", 
          "hopper", 
          "parity", 
          "hardness", 
          "problem", 
          "Hb"
        ], 
        "name": "Parallel and Concurrent Security of the HB and HB+ Protocols", 
        "pagination": "402-421", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1012126245"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00145-010-9061-2"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00145-010-9061-2", 
          "https://app.dimensions.ai/details/publication/pub.1012126245"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-06-01T22:09", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/article/article_505.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s00145-010-9061-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/s00145-010-9061-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/s00145-010-9061-2'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00145-010-9061-2'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00145-010-9061-2'


     

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

    156 TRIPLES      22 PREDICATES      68 URIs      48 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00145-010-9061-2 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N03ebe2de84444df2b278e2aa701c17b5
    4 schema:citation sg:pub.10.1007/11535218_18
    5 sg:pub.10.1007/11538462_32
    6 sg:pub.10.1007/11761679_6
    7 sg:pub.10.1007/11832072_24
    8 sg:pub.10.1007/11941378_5
    9 sg:pub.10.1007/3-540-45682-1_4
    10 sg:pub.10.1007/3-540-48329-2_24
    11 sg:pub.10.1007/978-3-540-30576-7_2
    12 sg:pub.10.1007/978-3-540-78967-3_21
    13 sg:pub.10.1007/978-3-540-85230-8_12
    14 sg:pub.10.1007/bf00195207
    15 sg:pub.10.1007/bfb0053430
    16 schema:datePublished 2010-02-17
    17 schema:datePublishedReg 2010-02-17
    18 schema:description Hopper and Blum (Asiacrypt 2001) and Juels and Weis (Crypto 2005) recently proposed two shared-key authentication protocols—HB and HB+, respectively—whose extremely low computational cost makes them attractive for low-cost devices such as radio-frequency identification (RFID) tags. The security of these protocols is based on the conjectured hardness of the “learning parity with noise” (LPN) problem, which is equivalent to the problem of decoding random binary linear codes. The HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks.
    19 schema:genre article
    20 schema:inLanguage en
    21 schema:isAccessibleForFree true
    22 schema:isPartOf N757ab73adaa54f80aec7b337a71eac3b
    23 N85d071150a564a13b20fcb3ee2d1f9b7
    24 sg:journal.1136278
    25 schema:keywords Blum
    26 HB protocol
    27 Hb
    28 Juels
    29 Learning Parity
    30 Wei
    31 active attacks
    32 adversary
    33 attacks
    34 binary linear codes
    35 code
    36 computational cost
    37 concurrent security
    38 conjectured hardness
    39 cost
    40 devices
    41 hardness
    42 hopper
    43 identification tags
    44 linear codes
    45 low computational cost
    46 low-cost devices
    47 noise
    48 parity
    49 passive adversary
    50 problem
    51 protocol
    52 radio frequency identification (RFID) tags
    53 random binary linear codes
    54 security
    55 tags
    56 schema:name Parallel and Concurrent Security of the HB and HB+ Protocols
    57 schema:pagination 402-421
    58 schema:productId N7caa890e92c04efb87ff5333517a9b63
    59 Nc15ac7d4afb74253a37f579bb0873e0f
    60 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012126245
    61 https://doi.org/10.1007/s00145-010-9061-2
    62 schema:sdDatePublished 2022-06-01T22:09
    63 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    64 schema:sdPublisher Nb48dbeddb71d48dd9860b25ec5ea1b5d
    65 schema:url https://doi.org/10.1007/s00145-010-9061-2
    66 sgo:license sg:explorer/license/
    67 sgo:sdDataset articles
    68 rdf:type schema:ScholarlyArticle
    69 N03ebe2de84444df2b278e2aa701c17b5 rdf:first sg:person.01354261156.67
    70 rdf:rest N09e0f268122b4417b02d8ee3f147ba64
    71 N09e0f268122b4417b02d8ee3f147ba64 rdf:first sg:person.015326027245.79
    72 rdf:rest N45c584e97e554041a25fe090dda67690
    73 N45c584e97e554041a25fe090dda67690 rdf:first sg:person.013307226666.21
    74 rdf:rest rdf:nil
    75 N757ab73adaa54f80aec7b337a71eac3b schema:volumeNumber 23
    76 rdf:type schema:PublicationVolume
    77 N7caa890e92c04efb87ff5333517a9b63 schema:name dimensions_id
    78 schema:value pub.1012126245
    79 rdf:type schema:PropertyValue
    80 N85d071150a564a13b20fcb3ee2d1f9b7 schema:issueNumber 3
    81 rdf:type schema:PublicationIssue
    82 Nb48dbeddb71d48dd9860b25ec5ea1b5d schema:name Springer Nature - SN SciGraph project
    83 rdf:type schema:Organization
    84 Nc15ac7d4afb74253a37f579bb0873e0f schema:name doi
    85 schema:value 10.1007/s00145-010-9061-2
    86 rdf:type schema:PropertyValue
    87 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    88 schema:name Information and Computing Sciences
    89 rdf:type schema:DefinedTerm
    90 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    91 schema:name Data Format
    92 rdf:type schema:DefinedTerm
    93 sg:grant.3084991 http://pending.schema.org/fundedItem sg:pub.10.1007/s00145-010-9061-2
    94 rdf:type schema:MonetaryGrant
    95 sg:journal.1136278 schema:issn 0933-2790
    96 1432-1378
    97 schema:name Journal of Cryptology
    98 schema:publisher Springer Nature
    99 rdf:type schema:Periodical
    100 sg:person.013307226666.21 schema:affiliation grid-institutes:grid.29857.31
    101 schema:familyName Smith
    102 schema:givenName Adam
    103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21
    104 rdf:type schema:Person
    105 sg:person.01354261156.67 schema:affiliation grid-institutes:grid.410443.6
    106 schema:familyName Katz
    107 schema:givenName Jonathan
    108 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01354261156.67
    109 rdf:type schema:Person
    110 sg:person.015326027245.79 schema:affiliation grid-institutes:grid.410443.6
    111 schema:familyName Shin
    112 schema:givenName Ji Sun
    113 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015326027245.79
    114 rdf:type schema:Person
    115 sg:pub.10.1007/11535218_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048110650
    116 https://doi.org/10.1007/11535218_18
    117 rdf:type schema:CreativeWork
    118 sg:pub.10.1007/11538462_32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022279726
    119 https://doi.org/10.1007/11538462_32
    120 rdf:type schema:CreativeWork
    121 sg:pub.10.1007/11761679_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037494651
    122 https://doi.org/10.1007/11761679_6
    123 rdf:type schema:CreativeWork
    124 sg:pub.10.1007/11832072_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009973045
    125 https://doi.org/10.1007/11832072_24
    126 rdf:type schema:CreativeWork
    127 sg:pub.10.1007/11941378_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033812388
    128 https://doi.org/10.1007/11941378_5
    129 rdf:type schema:CreativeWork
    130 sg:pub.10.1007/3-540-45682-1_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027730722
    131 https://doi.org/10.1007/3-540-45682-1_4
    132 rdf:type schema:CreativeWork
    133 sg:pub.10.1007/3-540-48329-2_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045214757
    134 https://doi.org/10.1007/3-540-48329-2_24
    135 rdf:type schema:CreativeWork
    136 sg:pub.10.1007/978-3-540-30576-7_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047370291
    137 https://doi.org/10.1007/978-3-540-30576-7_2
    138 rdf:type schema:CreativeWork
    139 sg:pub.10.1007/978-3-540-78967-3_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028765794
    140 https://doi.org/10.1007/978-3-540-78967-3_21
    141 rdf:type schema:CreativeWork
    142 sg:pub.10.1007/978-3-540-85230-8_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000904993
    143 https://doi.org/10.1007/978-3-540-85230-8_12
    144 rdf:type schema:CreativeWork
    145 sg:pub.10.1007/bf00195207 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051079135
    146 https://doi.org/10.1007/bf00195207
    147 rdf:type schema:CreativeWork
    148 sg:pub.10.1007/bfb0053430 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045273682
    149 https://doi.org/10.1007/bfb0053430
    150 rdf:type schema:CreativeWork
    151 grid-institutes:grid.29857.31 schema:alternateName Dept. of Computer Science and Engineering, The Pennsylvania State University, University Park, USA
    152 schema:name Dept. of Computer Science and Engineering, The Pennsylvania State University, University Park, USA
    153 rdf:type schema:Organization
    154 grid-institutes:grid.410443.6 schema:alternateName Dept. of Computer Science, University of Maryland, College Park, USA
    155 schema:name Dept. of Computer Science, University of Maryland, College Park, USA
    156 rdf:type schema:Organization
     




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


    ...