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", 
    "inLanguage": "en", 
    "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", 
      "applications", 
      "input", 
      "proof", 
      "technique", 
      "efficiency", 
      "context", 
      "need", 
      "model", 
      "order", 
      "method", 
      "construction", 
      "function", 
      "et al", 
      "different constructions", 
      "sequence", 
      "collisions", 
      "purpose", 
      "whirlpool", 
      "results", 
      "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-06-01T22:31", 
    "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/chapter/chapter_264.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.

110 TRIPLES      23 PREDICATES      65 URIs      58 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 N038fd52a5d304e3e85d22734bca9d558
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 N71aaf4f376cd4875ab6c328b5241552a
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N5b7c4fb9680b46fba8c134a42c215aac
12 schema:keywords Black et al
13 SHA-1
14 al
15 applications
16 attacks
17 blackbox model
18 blockcipher
19 blockcipher-based hash functions
20 bounds
21 collisions
22 compression function
23 construction
24 context
25 different constructions
26 dither sequences
27 efficiency
28 et al
29 function
30 generic attacks
31 hash function
32 input
33 method
34 model
35 need
36 order
37 paper
38 popular hash functions
39 previous proposals
40 proof
41 proposal
42 purpose
43 resistance
44 results
45 scheme
46 security
47 security bounds
48 sequence
49 technique
50 values
51 whirlpool
52 schema:name How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
53 schema:pagination 308-324
54 schema:productId N12db368918af4329a4ce9d694eada0e7
55 Nc4d97868e57547c99eb9704997d31db7
56 schema:publisher N5d49c1159feb463b89284c8e31e5af87
57 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002349308
58 https://doi.org/10.1007/978-3-540-68164-9_21
59 schema:sdDatePublished 2022-06-01T22:31
60 schema:sdLicense https://scigraph.springernature.com/explorer/license/
61 schema:sdPublisher N9499a9aa2e614e8f8c22a4cf6455f61d
62 schema:url https://doi.org/10.1007/978-3-540-68164-9_21
63 sgo:license sg:explorer/license/
64 sgo:sdDataset chapters
65 rdf:type schema:Chapter
66 N038fd52a5d304e3e85d22734bca9d558 rdf:first sg:person.012606440341.66
67 rdf:rest N9a05644a23d94c9ab6e696b9b642a50e
68 N12db368918af4329a4ce9d694eada0e7 schema:name doi
69 schema:value 10.1007/978-3-540-68164-9_21
70 rdf:type schema:PropertyValue
71 N13cc6cbc19c84c76a8eef17740e07420 schema:familyName Vaudenay
72 schema:givenName Serge
73 rdf:type schema:Person
74 N5b7c4fb9680b46fba8c134a42c215aac schema:isbn 978-3-540-68159-5
75 978-3-540-68164-9
76 schema:name Progress in Cryptology – AFRICACRYPT 2008
77 rdf:type schema:Book
78 N5d49c1159feb463b89284c8e31e5af87 schema:name Springer Nature
79 rdf:type schema:Organisation
80 N71aaf4f376cd4875ab6c328b5241552a rdf:first N13cc6cbc19c84c76a8eef17740e07420
81 rdf:rest rdf:nil
82 N9499a9aa2e614e8f8c22a4cf6455f61d schema:name Springer Nature - SN SciGraph project
83 rdf:type schema:Organization
84 N9a05644a23d94c9ab6e696b9b642a50e rdf:first sg:person.014732232610.32
85 rdf:rest rdf:nil
86 Nc4d97868e57547c99eb9704997d31db7 schema:name dimensions_id
87 schema:value pub.1002349308
88 rdf:type schema:PropertyValue
89 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
90 schema:name Information and Computing Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
93 schema:name Data Format
94 rdf:type schema:DefinedTerm
95 sg:person.012606440341.66 schema:affiliation grid-institutes:grid.410380.e
96 schema:familyName Aumasson
97 schema:givenName Jean-Philippe
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66
99 rdf:type schema:Person
100 sg:person.014732232610.32 schema:affiliation grid-institutes:grid.6571.5
101 schema:familyName Phan
102 schema:givenName Raphael C. -W.
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014732232610.32
104 rdf:type schema:Person
105 grid-institutes:grid.410380.e schema:alternateName FHNW, 5210, Windisch, Switzerland
106 schema:name FHNW, 5210, Windisch, Switzerland
107 rdf:type schema:Organization
108 grid-institutes:grid.6571.5 schema:alternateName Loughborough Uni, LE11 3TU, Leics, UK
109 schema:name Loughborough Uni, LE11 3TU, Leics, UK
110 rdf:type schema:Organization
 




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


...