Security Reductions of the Second Round SHA-3 Candidates View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2011

AUTHORS

Elena Andreeva , Bart Mennink , Bart Preneel

ABSTRACT

In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. At present, 14 candidates are left in the second round. An important criterion in the selection process is the SHA-3 hash function security and more concretely, the possible security reductions of the hash function to the security of its underlying building blocks. While some of the candidates are supported with firm security reductions, for most of the schemes these results are still incomplete. In this paper, we compare the state of the art provable security reductions of the second round SHA-3 candidates. Surprisingly, we derive some security bounds from the literature, which the hash function designers seem to be unaware of. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered. More... »

PAGES

39-53

Book

TITLE

Information Security

ISBN

978-3-642-18177-1
978-3-642-18178-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-18178-8_5

DOI

http://dx.doi.org/10.1007/978-3-642-18178-8_5

DIMENSIONS

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


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": "IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC, Katholieke Universiteit Leuven, Belgium", 
            "IBBT, Katholieke Universiteit Leuven, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Andreeva", 
        "givenName": "Elena", 
        "id": "sg:person.010624232445.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC, Katholieke Universiteit Leuven, Belgium", 
            "IBBT, Katholieke Universiteit 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": "IBBT, Katholieke Universiteit Leuven, Belgium", 
          "id": "http://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Dept. Electrical Engineering, ESAT/COSIC, Katholieke Universiteit Leuven, Belgium", 
            "IBBT, Katholieke Universiteit 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": "2011", 
    "datePublishedReg": "2011-01-01", 
    "description": "In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. At present, 14 candidates are left in the second round. An important criterion in the selection process is the SHA-3 hash function security and more concretely, the possible security reductions of the hash function to the security of its underlying building blocks. While some of the candidates are supported with firm security reductions, for most of the schemes these results are still incomplete. In this paper, we compare the state of the art provable security reductions of the second round SHA-3 candidates. Surprisingly, we derive some security bounds from the literature, which the hash function designers seem to be unaware of. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.", 
    "editor": [
      {
        "familyName": "Burmester", 
        "givenName": "Mike", 
        "type": "Person"
      }, 
      {
        "familyName": "Tsudik", 
        "givenName": "Gene", 
        "type": "Person"
      }, 
      {
        "familyName": "Magliveras", 
        "givenName": "Spyros", 
        "type": "Person"
      }, 
      {
        "familyName": "Ili\u0107", 
        "givenName": "Ivana", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-18178-8_5", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-18177-1", 
        "978-3-642-18178-8"
      ], 
      "name": "Information Security", 
      "type": "Book"
    }, 
    "keywords": [
      "security reduction", 
      "SHA-3 candidates", 
      "hash function", 
      "second round SHA-3 candidates", 
      "cryptographic hash algorithm", 
      "new cryptographic hash algorithm", 
      "hash function security", 
      "hash algorithm", 
      "SHA-1", 
      "security bounds", 
      "security", 
      "selection process", 
      "MD5", 
      "building blocks", 
      "algorithm", 
      "designers", 
      "important criteria", 
      "technology", 
      "scheme", 
      "NIST", 
      "padding", 
      "US National Institutes", 
      "proof", 
      "submission", 
      "vulnerability", 
      "rounds", 
      "bounds", 
      "design", 
      "calls", 
      "block", 
      "standards", 
      "process", 
      "candidates", 
      "first round", 
      "function", 
      "state", 
      "results", 
      "second round", 
      "preservation", 
      "National Institute", 
      "criteria", 
      "literature", 
      "Institute", 
      "reduction", 
      "response", 
      "paper"
    ], 
    "name": "Security Reductions of the Second Round SHA-3 Candidates", 
    "pagination": "39-53", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047663745"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-18178-8_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-18178-8_5", 
      "https://app.dimensions.ai/details/publication/pub.1047663745"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-12-01T06:51", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221201/entities/gbq_results/chapter/chapter_35.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-18178-8_5"
  }
]
 

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-642-18178-8_5'

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-642-18178-8_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-18178-8_5'

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-642-18178-8_5'


 

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

135 TRIPLES      22 PREDICATES      71 URIs      64 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-18178-8_5 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N12121132bf6e4643b186c69cd765b38f
4 schema:datePublished 2011
5 schema:datePublishedReg 2011-01-01
6 schema:description In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. At present, 14 candidates are left in the second round. An important criterion in the selection process is the SHA-3 hash function security and more concretely, the possible security reductions of the hash function to the security of its underlying building blocks. While some of the candidates are supported with firm security reductions, for most of the schemes these results are still incomplete. In this paper, we compare the state of the art provable security reductions of the second round SHA-3 candidates. Surprisingly, we derive some security bounds from the literature, which the hash function designers seem to be unaware of. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.
7 schema:editor Ne586d3bd0a814efb9a38381a8e29be45
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf Nfa176423e25d46989c36e3dba7646143
11 schema:keywords Institute
12 MD5
13 NIST
14 National Institute
15 SHA-1
16 SHA-3 candidates
17 US National Institutes
18 algorithm
19 block
20 bounds
21 building blocks
22 calls
23 candidates
24 criteria
25 cryptographic hash algorithm
26 design
27 designers
28 first round
29 function
30 hash algorithm
31 hash function
32 hash function security
33 important criteria
34 literature
35 new cryptographic hash algorithm
36 padding
37 paper
38 preservation
39 process
40 proof
41 reduction
42 response
43 results
44 rounds
45 scheme
46 second round
47 second round SHA-3 candidates
48 security
49 security bounds
50 security reduction
51 selection process
52 standards
53 state
54 submission
55 technology
56 vulnerability
57 schema:name Security Reductions of the Second Round SHA-3 Candidates
58 schema:pagination 39-53
59 schema:productId N3a67a3922acd44749ec3ab2ea499845a
60 N54775f2927d14c37a94c8d7e0e4a4508
61 schema:publisher Nbe26c6d7909c40a884cee4609a87ed5d
62 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047663745
63 https://doi.org/10.1007/978-3-642-18178-8_5
64 schema:sdDatePublished 2022-12-01T06:51
65 schema:sdLicense https://scigraph.springernature.com/explorer/license/
66 schema:sdPublisher N75cc74f6854e43d38d9cc897ca1bab11
67 schema:url https://doi.org/10.1007/978-3-642-18178-8_5
68 sgo:license sg:explorer/license/
69 sgo:sdDataset chapters
70 rdf:type schema:Chapter
71 N12121132bf6e4643b186c69cd765b38f rdf:first sg:person.010624232445.91
72 rdf:rest N6985420c51ff4fe6a1f923c286568fc4
73 N21bc917961ef41adb994b7d68b791c61 schema:familyName Burmester
74 schema:givenName Mike
75 rdf:type schema:Person
76 N3a67a3922acd44749ec3ab2ea499845a schema:name dimensions_id
77 schema:value pub.1047663745
78 rdf:type schema:PropertyValue
79 N44b46299eed14a48b416e628df4c62e0 schema:familyName Magliveras
80 schema:givenName Spyros
81 rdf:type schema:Person
82 N54775f2927d14c37a94c8d7e0e4a4508 schema:name doi
83 schema:value 10.1007/978-3-642-18178-8_5
84 rdf:type schema:PropertyValue
85 N6985420c51ff4fe6a1f923c286568fc4 rdf:first sg:person.012130641461.76
86 rdf:rest Ncde97f367e8d42eb82d0056621cb05e8
87 N75cc74f6854e43d38d9cc897ca1bab11 schema:name Springer Nature - SN SciGraph project
88 rdf:type schema:Organization
89 N836cc917556540df9f4f74e9a0379e14 schema:familyName Tsudik
90 schema:givenName Gene
91 rdf:type schema:Person
92 Nbe26c6d7909c40a884cee4609a87ed5d schema:name Springer Nature
93 rdf:type schema:Organisation
94 Ncde97f367e8d42eb82d0056621cb05e8 rdf:first sg:person.011115044357.39
95 rdf:rest rdf:nil
96 Nd2bf5e445ead48e8ac50f64a563219bf rdf:first N44b46299eed14a48b416e628df4c62e0
97 rdf:rest Ne281a04e7d404320bfadbaefcbb0a87c
98 Ne281a04e7d404320bfadbaefcbb0a87c rdf:first Nea5ae71c3a314e2e8be48dbb39b3bd74
99 rdf:rest rdf:nil
100 Ne586d3bd0a814efb9a38381a8e29be45 rdf:first N21bc917961ef41adb994b7d68b791c61
101 rdf:rest Nf288210087da44fc960165333fafea9e
102 Nea5ae71c3a314e2e8be48dbb39b3bd74 schema:familyName Ilić
103 schema:givenName Ivana
104 rdf:type schema:Person
105 Nf288210087da44fc960165333fafea9e rdf:first N836cc917556540df9f4f74e9a0379e14
106 rdf:rest Nd2bf5e445ead48e8ac50f64a563219bf
107 Nfa176423e25d46989c36e3dba7646143 schema:isbn 978-3-642-18177-1
108 978-3-642-18178-8
109 schema:name Information Security
110 rdf:type schema:Book
111 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
112 schema:name Information and Computing Sciences
113 rdf:type schema:DefinedTerm
114 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
115 schema:name Data Format
116 rdf:type schema:DefinedTerm
117 sg:person.010624232445.91 schema:affiliation grid-institutes:grid.5596.f
118 schema:familyName Andreeva
119 schema:givenName Elena
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010624232445.91
121 rdf:type schema:Person
122 sg:person.011115044357.39 schema:affiliation grid-institutes:grid.5596.f
123 schema:familyName Preneel
124 schema:givenName Bart
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011115044357.39
126 rdf:type schema:Person
127 sg:person.012130641461.76 schema:affiliation grid-institutes:grid.5596.f
128 schema:familyName Mennink
129 schema:givenName Bart
130 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012130641461.76
131 rdf:type schema:Person
132 grid-institutes:grid.5596.f schema:alternateName IBBT, Katholieke Universiteit Leuven, Belgium
133 schema:name Dept. Electrical Engineering, ESAT/COSIC, Katholieke Universiteit Leuven, Belgium
134 IBBT, Katholieke Universiteit Leuven, Belgium
135 rdf:type schema:Organization
 




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


...