On the Impact of Known-Key Attacks on Hash Functions View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2015-12-30

AUTHORS

Bart Mennink , Bart Preneel

ABSTRACT

Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher model. However, once these random primitives are instantiated, vulnerabilities of these instantiations may nullify the security. At ASIACRYPT 2007, Knudsen and Rijmen introduced known-key security of blockciphers, which gave rise to many distinguishing attacks on existing blockcipher constructions. In this work, we analyze the impact of such attacks on primitive-based hash functions. We present and formalize the weak cipher model, which captures the case a blockcipher has a certain weakness but is perfectly random otherwise. A specific instance of this model, considering the existence of sets of B queries whose XOR equals 0 at bit-positions C, where C is an index set, covers a wide range of known-key attacks in literature. We apply this instance to the PGV compression functions, as well as to the Grøstl (based on two permutations) and Shrimpton-Stam (based on three permutations) compression functions, and show that these designs do not seriously succumb to any differential known-key attack known to date. More... »

PAGES

59-84

Book

TITLE

Advances in Cryptology – ASIACRYPT 2015

ISBN

978-3-662-48799-0
978-3-662-48800-3

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-48800-3_3

DOI

http://dx.doi.org/10.1007/978-3-662-48800-3_3

DIMENSIONS

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


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": "Department of Electrical Engineering, ESAT/COSIC, KU Leuven and iMinds, Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Department of Electrical Engineering, ESAT/COSIC, KU Leuven and iMinds, Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mennink", 
        "givenName": "Bart", 
        "id": "sg:person.012130641461.76", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, ESAT/COSIC, KU Leuven and iMinds, Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Department of Electrical Engineering, ESAT/COSIC, KU Leuven and iMinds, Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Preneel", 
        "givenName": "Bart", 
        "id": "sg:person.011115044357.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-12-30", 
    "datePublishedReg": "2015-12-30", 
    "description": "Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher model. However, once these random primitives are instantiated, vulnerabilities of these instantiations may nullify the security. At ASIACRYPT 2007, Knudsen and Rijmen introduced known-key security of blockciphers, which gave rise to many distinguishing attacks on existing blockcipher constructions. In this work, we analyze the impact of such attacks on primitive-based hash functions. We present and formalize the weak cipher model, which captures the case a blockcipher has a certain weakness but is perfectly random otherwise. A specific instance of this model, considering the existence of sets of B queries whose XOR equals 0 at bit-positions C, where C is an index set, covers a wide range of known-key attacks in literature. We apply this instance to the PGV compression functions, as well as to the Gr\u00f8stl (based on two permutations) and Shrimpton-Stam (based on three permutations) compression functions, and show that these designs do not seriously succumb to any differential known-key attack known to date.", 
    "editor": [
      {
        "familyName": "Iwata", 
        "givenName": "Tetsu", 
        "type": "Person"
      }, 
      {
        "familyName": "Cheon", 
        "givenName": "Jung Hee", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-48800-3_3", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-48799-0", 
        "978-3-662-48800-3"
      ], 
      "name": "Advances in Cryptology \u2013 ASIACRYPT 2015", 
      "type": "Book"
    }, 
    "keywords": [
      "hash function", 
      "known-key attacks", 
      "cipher model", 
      "compression function", 
      "known-key security", 
      "security proof", 
      "such attacks", 
      "ASIACRYPT 2007", 
      "PGV compression functions", 
      "blockcipher", 
      "random primitives", 
      "attacks", 
      "security", 
      "specific instances", 
      "queries", 
      "primitives", 
      "instantiation", 
      "ideal permutation", 
      "set", 
      "index set", 
      "instances", 
      "XOR", 
      "certain weaknesses", 
      "Gr\u00f8stl", 
      "permutations", 
      "Rijmen", 
      "model", 
      "proof", 
      "wide range", 
      "vulnerability", 
      "design", 
      "work", 
      "weakness", 
      "construction", 
      "function", 
      "existence of sets", 
      "impact", 
      "literature", 
      "cases", 
      "date", 
      "range", 
      "rise", 
      "existence", 
      "Knudsen"
    ], 
    "name": "On the Impact of Known-Key Attacks on Hash Functions", 
    "pagination": "59-84", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1026658648"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-48800-3_3"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-48800-3_3", 
      "https://app.dimensions.ai/details/publication/pub.1026658648"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-09-02T16:13", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220902/entities/gbq_results/chapter/chapter_297.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-48800-3_3"
  }
]
 

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-662-48800-3_3'

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-662-48800-3_3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-48800-3_3'

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-662-48800-3_3'


 

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

115 TRIPLES      22 PREDICATES      68 URIs      61 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-48800-3_3 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N0d213d8d95e94b07b2a90f29380bbfe8
4 schema:datePublished 2015-12-30
5 schema:datePublishedReg 2015-12-30
6 schema:description Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher model. However, once these random primitives are instantiated, vulnerabilities of these instantiations may nullify the security. At ASIACRYPT 2007, Knudsen and Rijmen introduced known-key security of blockciphers, which gave rise to many distinguishing attacks on existing blockcipher constructions. In this work, we analyze the impact of such attacks on primitive-based hash functions. We present and formalize the weak cipher model, which captures the case a blockcipher has a certain weakness but is perfectly random otherwise. A specific instance of this model, considering the existence of sets of B queries whose XOR equals 0 at bit-positions C, where C is an index set, covers a wide range of known-key attacks in literature. We apply this instance to the PGV compression functions, as well as to the Grøstl (based on two permutations) and Shrimpton-Stam (based on three permutations) compression functions, and show that these designs do not seriously succumb to any differential known-key attack known to date.
7 schema:editor N0b9d3a7572cb482098d6800af9044100
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Na74914e6206347acb1e535ab9e7320c5
11 schema:keywords ASIACRYPT 2007
12 Grøstl
13 Knudsen
14 PGV compression functions
15 Rijmen
16 XOR
17 attacks
18 blockcipher
19 cases
20 certain weaknesses
21 cipher model
22 compression function
23 construction
24 date
25 design
26 existence
27 existence of sets
28 function
29 hash function
30 ideal permutation
31 impact
32 index set
33 instances
34 instantiation
35 known-key attacks
36 known-key security
37 literature
38 model
39 permutations
40 primitives
41 proof
42 queries
43 random primitives
44 range
45 rise
46 security
47 security proof
48 set
49 specific instances
50 such attacks
51 vulnerability
52 weakness
53 wide range
54 work
55 schema:name On the Impact of Known-Key Attacks on Hash Functions
56 schema:pagination 59-84
57 schema:productId N63a2c6713df54fb79b4cffa43534e4e2
58 Nd7e276f2bf0a41b2ba81fe82276caa5b
59 schema:publisher N14d75e4e95374c1a8e04d8baad2df3ac
60 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026658648
61 https://doi.org/10.1007/978-3-662-48800-3_3
62 schema:sdDatePublished 2022-09-02T16:13
63 schema:sdLicense https://scigraph.springernature.com/explorer/license/
64 schema:sdPublisher Nc7c7baa47c5947b1b624311178d90f72
65 schema:url https://doi.org/10.1007/978-3-662-48800-3_3
66 sgo:license sg:explorer/license/
67 sgo:sdDataset chapters
68 rdf:type schema:Chapter
69 N044f201e4e6349b79a00b4bdf81ac02f schema:familyName Cheon
70 schema:givenName Jung Hee
71 rdf:type schema:Person
72 N0b9d3a7572cb482098d6800af9044100 rdf:first N95ccda8542084578bae99a6fe6b5201d
73 rdf:rest Nedda35958eed48fcb8f5aaa8a18f88f2
74 N0d213d8d95e94b07b2a90f29380bbfe8 rdf:first sg:person.012130641461.76
75 rdf:rest N5d867836bae34faab59e5acc23df497f
76 N14d75e4e95374c1a8e04d8baad2df3ac schema:name Springer Nature
77 rdf:type schema:Organisation
78 N5d867836bae34faab59e5acc23df497f rdf:first sg:person.011115044357.39
79 rdf:rest rdf:nil
80 N63a2c6713df54fb79b4cffa43534e4e2 schema:name doi
81 schema:value 10.1007/978-3-662-48800-3_3
82 rdf:type schema:PropertyValue
83 N95ccda8542084578bae99a6fe6b5201d schema:familyName Iwata
84 schema:givenName Tetsu
85 rdf:type schema:Person
86 Na74914e6206347acb1e535ab9e7320c5 schema:isbn 978-3-662-48799-0
87 978-3-662-48800-3
88 schema:name Advances in Cryptology – ASIACRYPT 2015
89 rdf:type schema:Book
90 Nc7c7baa47c5947b1b624311178d90f72 schema:name Springer Nature - SN SciGraph project
91 rdf:type schema:Organization
92 Nd7e276f2bf0a41b2ba81fe82276caa5b schema:name dimensions_id
93 schema:value pub.1026658648
94 rdf:type schema:PropertyValue
95 Nedda35958eed48fcb8f5aaa8a18f88f2 rdf:first N044f201e4e6349b79a00b4bdf81ac02f
96 rdf:rest rdf:nil
97 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
98 schema:name Information and Computing Sciences
99 rdf:type schema:DefinedTerm
100 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
101 schema:name Data Format
102 rdf:type schema:DefinedTerm
103 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.5596.f
104 schema:familyName Preneel
105 schema:givenName Bart
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
107 rdf:type schema:Person
108 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.5596.f
109 schema:familyName Mennink
110 schema:givenName Bart
111 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
112 rdf:type schema:Person
113 grid-institutes:grid.5596.f schema:alternateName Department of Electrical Engineering, ESAT/COSIC, KU Leuven and iMinds, Leuven, Belgium
114 schema:name Department of Electrical Engineering, ESAT/COSIC, KU Leuven and iMinds, Leuven, Belgium
115 rdf:type schema:Organization
 




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


...