How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2008-01-01

AUTHORS

Jean-Philippe Aumasson , Raphael C. -W. Phan

ABSTRACT

In the context of iterated hash functions, “dithering” designates the technique of adding an iteration-dependent input to the compression function in order to defeat certain generic attacks. The purpose of this paper is to identify methods for dithering blockcipher-based hash functions that provide security bounds and efficiency, contrary to the previous proposals. We considered 56 different constructions, based on the 12 secure PGV schemes. Proofs are given in the blackbox model that 12 of them preserve the bounds on collision and inversion resistance given by Black et al. These 12 schemes avoid the need for short dither values, induce negligible extra-computation, and achieve security independent of the dither sequence used. We also identify 8 schemes that lead to strong compression functions but potentially insecure hash functions. Application of our results can be considered to popular hash functions like SHA-1 or Whirlpool. More... »

PAGES

308-324

Book

TITLE

Progress in Cryptology – AFRICACRYPT 2008

ISBN

978-3-540-68159-5
978-3-540-68164-9

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-68164-9_21

DOI

http://dx.doi.org/10.1007/978-3-540-68164-9_21

DIMENSIONS

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


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": "FHNW, 5210, Windisch, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.410380.e", 
          "name": [
            "FHNW, 5210, Windisch, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Aumasson", 
        "givenName": "Jean-Philippe", 
        "id": "sg:person.012606440341.66", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Loughborough Uni, LE11 3TU, Leics, UK", 
          "id": "http://www.grid.ac/institutes/grid.6571.5", 
          "name": [
            "Loughborough Uni, LE11 3TU, Leics, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Phan", 
        "givenName": "Raphael C. -W.", 
        "id": "sg:person.014732232610.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014732232610.32"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2008-01-01", 
    "datePublishedReg": "2008-01-01", 
    "description": "In the context of iterated hash functions, \u201cdithering\u201d designates the technique of adding an iteration-dependent input to the compression function in order to defeat certain generic attacks. The purpose of this paper is to identify methods for dithering blockcipher-based hash functions that provide security bounds and efficiency, contrary to the previous proposals. We considered 56 different constructions, based on the 12 secure PGV schemes. Proofs are given in the blackbox model that 12 of them preserve the bounds on collision and inversion resistance given by Black et al. These 12 schemes avoid the need for short dither values, induce negligible extra-computation, and achieve security independent of the dither sequence used. We also identify 8 schemes that lead to strong compression functions but potentially insecure hash functions. Application of our results can be considered to popular hash functions like SHA-1 or Whirlpool.", 
    "editor": [
      {
        "familyName": "Vaudenay", 
        "givenName": "Serge", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-68164-9_21", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-68159-5", 
        "978-3-540-68164-9"
      ], 
      "name": "Progress in Cryptology \u2013 AFRICACRYPT 2008", 
      "type": "Book"
    }, 
    "keywords": [
      "hash function", 
      "popular hash functions", 
      "compression function", 
      "blockcipher-based hash functions", 
      "SHA-1", 
      "generic attacks", 
      "blackbox model", 
      "security bounds", 
      "dither sequences", 
      "previous proposals", 
      "scheme", 
      "security", 
      "blockcipher", 
      "attacks", 
      "bounds", 
      "proposal", 
      "input", 
      "applications", 
      "proof", 
      "technique", 
      "efficiency", 
      "context", 
      "need", 
      "model", 
      "order", 
      "method", 
      "construction", 
      "function", 
      "et al", 
      "different constructions", 
      "sequence", 
      "collisions", 
      "purpose", 
      "results", 
      "whirlpool", 
      "values", 
      "al", 
      "Black et al", 
      "resistance", 
      "paper"
    ], 
    "name": "How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?", 
    "pagination": "308-324", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1002349308"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-68164-9_21"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-68164-9_21", 
      "https://app.dimensions.ai/details/publication/pub.1002349308"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:21", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_45.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-68164-9_21"
  }
]
 

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-540-68164-9_21'

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-540-68164-9_21'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-68164-9_21'

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-540-68164-9_21'


 

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

109 TRIPLES      22 PREDICATES      64 URIs      57 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-68164-9_21 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N26c528cf226f478c935aa79a4f5c3c43
4 schema:datePublished 2008-01-01
5 schema:datePublishedReg 2008-01-01
6 schema:description In the context of iterated hash functions, “dithering” designates the technique of adding an iteration-dependent input to the compression function in order to defeat certain generic attacks. The purpose of this paper is to identify methods for dithering blockcipher-based hash functions that provide security bounds and efficiency, contrary to the previous proposals. We considered 56 different constructions, based on the 12 secure PGV schemes. Proofs are given in the blackbox model that 12 of them preserve the bounds on collision and inversion resistance given by Black et al. These 12 schemes avoid the need for short dither values, induce negligible extra-computation, and achieve security independent of the dither sequence used. We also identify 8 schemes that lead to strong compression functions but potentially insecure hash functions. Application of our results can be considered to popular hash functions like SHA-1 or Whirlpool.
7 schema:editor N37e6d1efee5a4ee3a284da0bc33fa23f
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N374fbf9697bf42938a1e67171daa85f9
11 schema:keywords Black et al
12 SHA-1
13 al
14 applications
15 attacks
16 blackbox model
17 blockcipher
18 blockcipher-based hash functions
19 bounds
20 collisions
21 compression function
22 construction
23 context
24 different constructions
25 dither sequences
26 efficiency
27 et al
28 function
29 generic attacks
30 hash function
31 input
32 method
33 model
34 need
35 order
36 paper
37 popular hash functions
38 previous proposals
39 proof
40 proposal
41 purpose
42 resistance
43 results
44 scheme
45 security
46 security bounds
47 sequence
48 technique
49 values
50 whirlpool
51 schema:name How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
52 schema:pagination 308-324
53 schema:productId N06b290f17e4c487bb1420a4ff8b25a68
54 N2aad098ac06647e8a61db928183863e1
55 schema:publisher N636e28f0cccd47428c8103efdf2274fa
56 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002349308
57 https://doi.org/10.1007/978-3-540-68164-9_21
58 schema:sdDatePublished 2022-08-04T17:21
59 schema:sdLicense https://scigraph.springernature.com/explorer/license/
60 schema:sdPublisher N182477b280b24a65b2c17c8a9ca5d490
61 schema:url https://doi.org/10.1007/978-3-540-68164-9_21
62 sgo:license sg:explorer/license/
63 sgo:sdDataset chapters
64 rdf:type schema:Chapter
65 N06b290f17e4c487bb1420a4ff8b25a68 schema:name dimensions_id
66 schema:value pub.1002349308
67 rdf:type schema:PropertyValue
68 N182477b280b24a65b2c17c8a9ca5d490 schema:name Springer Nature - SN SciGraph project
69 rdf:type schema:Organization
70 N26c528cf226f478c935aa79a4f5c3c43 rdf:first sg:person.012606440341.66
71 rdf:rest Nf3dca07823eb424aa6405805c8dcbafe
72 N2aad098ac06647e8a61db928183863e1 schema:name doi
73 schema:value 10.1007/978-3-540-68164-9_21
74 rdf:type schema:PropertyValue
75 N374fbf9697bf42938a1e67171daa85f9 schema:isbn 978-3-540-68159-5
76 978-3-540-68164-9
77 schema:name Progress in Cryptology – AFRICACRYPT 2008
78 rdf:type schema:Book
79 N37e6d1efee5a4ee3a284da0bc33fa23f rdf:first Ned1974c18ed94ff1a58175acd8965e53
80 rdf:rest rdf:nil
81 N636e28f0cccd47428c8103efdf2274fa schema:name Springer Nature
82 rdf:type schema:Organisation
83 Ned1974c18ed94ff1a58175acd8965e53 schema:familyName Vaudenay
84 schema:givenName Serge
85 rdf:type schema:Person
86 Nf3dca07823eb424aa6405805c8dcbafe rdf:first sg:person.014732232610.32
87 rdf:rest rdf:nil
88 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
89 schema:name Information and Computing Sciences
90 rdf:type schema:DefinedTerm
91 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
92 schema:name Data Format
93 rdf:type schema:DefinedTerm
94 sg:person.012606440341.66 schema:affiliation grid-institutes:grid.410380.e
95 schema:familyName Aumasson
96 schema:givenName Jean-Philippe
97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66
98 rdf:type schema:Person
99 sg:person.014732232610.32 schema:affiliation grid-institutes:grid.6571.5
100 schema:familyName Phan
101 schema:givenName Raphael C. -W.
102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014732232610.32
103 rdf:type schema:Person
104 grid-institutes:grid.410380.e schema:alternateName FHNW, 5210, Windisch, Switzerland
105 schema:name FHNW, 5210, Windisch, Switzerland
106 rdf:type schema:Organization
107 grid-institutes:grid.6571.5 schema:alternateName Loughborough Uni, LE11 3TU, Leics, UK
108 schema:name Loughborough Uni, LE11 3TU, Leics, UK
109 rdf:type schema:Organization
 




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


...