Building Secure Block Ciphers on Generic Attacks Assumptions View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2009

AUTHORS

Jacques Patarin , Yannick Seurin

ABSTRACT

Up to now, the design of block ciphers has been mainly driven by heuristic arguments, and little theory is known to constitute a good guideline for the development of their architecture. Trying to remedy this situation, we introduce a new type of design for symmetric cryptographic primitives with high self-similarity. Our design strategy enables to give a reductionist security proof for the primitive based on plausible assumptions regarding the complexity of the best distinguishing attacks on random Feistel schemes or other ideal constructions. Under these assumptions, the cryptographic primitives we obtain are perfectly secure against any adversary with computational resources less than a given bound. By opposition, other provably secure symmetric primitives, as for example C [3] and KFC [4], designed using information-theoretic results, are only proved to resist a limited (though significant) range of attacks. Our construction strategy leads to a large expanded key size, though still usable in practice (around 1 MB). More... »

PAGES

66-81

Book

TITLE

Selected Areas in Cryptography

ISBN

978-3-642-04158-7
978-3-642-04159-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-04159-4_5

DOI

http://dx.doi.org/10.1007/978-3-642-04159-4_5

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "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": "University of Versailles, France", 
          "id": "http://www.grid.ac/institutes/grid.12832.3a", 
          "name": [
            "University of Versailles, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Patarin", 
        "givenName": "Jacques", 
        "id": "sg:person.012254315647.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012254315647.07"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Orange Labs, Issy-les-Moulineaux, France", 
          "id": "http://www.grid.ac/institutes/grid.89485.38", 
          "name": [
            "University of Versailles, France", 
            "Orange Labs, Issy-les-Moulineaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Seurin", 
        "givenName": "Yannick", 
        "id": "sg:person.011724731171.01", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2009", 
    "datePublishedReg": "2009-01-01", 
    "description": "Up to now, the design of block ciphers has been mainly driven by heuristic arguments, and little theory is known to constitute a good guideline for the development of their architecture. Trying to remedy this situation, we introduce a new type of design for symmetric cryptographic primitives with high self-similarity. Our design strategy enables to give a reductionist security proof for the primitive based on plausible assumptions regarding the complexity of the best distinguishing attacks on random Feistel schemes or other ideal constructions. Under these assumptions, the cryptographic primitives we obtain are perfectly secure against any adversary with computational resources less than a given bound. By opposition, other provably secure symmetric primitives, as for example C [3] and KFC [4], designed using information-theoretic results, are only proved to resist a limited (though significant) range of attacks. Our construction strategy leads to a large expanded key size, though still usable in practice (around 1 MB).", 
    "editor": [
      {
        "familyName": "Avanzi", 
        "givenName": "Roberto Maria", 
        "type": "Person"
      }, 
      {
        "familyName": "Keliher", 
        "givenName": "Liam", 
        "type": "Person"
      }, 
      {
        "familyName": "Sica", 
        "givenName": "Francesco", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-04159-4_5", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-04158-7", 
        "978-3-642-04159-4"
      ], 
      "name": "Selected Areas in Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "cryptographic primitives", 
      "block cipher", 
      "symmetric cryptographic primitives", 
      "reductionist security proof", 
      "secure block cipher", 
      "random Feistel schemes", 
      "information-theoretic results", 
      "security proof", 
      "key size", 
      "computational resources", 
      "symmetric primitives", 
      "primitives", 
      "cipher", 
      "Feistel schemes", 
      "attacks", 
      "example C", 
      "construction strategy", 
      "adversary", 
      "architecture", 
      "complexity", 
      "little theory", 
      "design", 
      "scheme", 
      "design strategy", 
      "resources", 
      "new type", 
      "better guidelines", 
      "proof", 
      "assumption", 
      "strategies", 
      "situation", 
      "heuristic arguments", 
      "construction", 
      "limited range", 
      "development", 
      "results", 
      "ideal construction", 
      "practice", 
      "types", 
      "theory", 
      "size", 
      "guidelines", 
      "plausible assumptions", 
      "Kfc", 
      "range", 
      "argument", 
      "opposition"
    ], 
    "name": "Building Secure Block Ciphers on Generic Attacks Assumptions", 
    "pagination": "66-81", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1034497812"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-04159-4_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-04159-4_5", 
      "https://app.dimensions.ai/details/publication/pub.1034497812"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-11-24T21:19", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221124/entities/gbq_results/chapter/chapter_50.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-04159-4_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-04159-4_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-04159-4_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-04159-4_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-04159-4_5'


 

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

131 TRIPLES      22 PREDICATES      73 URIs      65 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-04159-4_5 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 anzsrc-for:0804
4 schema:author N9bbd524254494f0ba29c0ae7e137050d
5 schema:datePublished 2009
6 schema:datePublishedReg 2009-01-01
7 schema:description Up to now, the design of block ciphers has been mainly driven by heuristic arguments, and little theory is known to constitute a good guideline for the development of their architecture. Trying to remedy this situation, we introduce a new type of design for symmetric cryptographic primitives with high self-similarity. Our design strategy enables to give a reductionist security proof for the primitive based on plausible assumptions regarding the complexity of the best distinguishing attacks on random Feistel schemes or other ideal constructions. Under these assumptions, the cryptographic primitives we obtain are perfectly secure against any adversary with computational resources less than a given bound. By opposition, other provably secure symmetric primitives, as for example C [3] and KFC [4], designed using information-theoretic results, are only proved to resist a limited (though significant) range of attacks. Our construction strategy leads to a large expanded key size, though still usable in practice (around 1 MB).
8 schema:editor Nbcfed24ae2a948cb9eb2c8a14cc76cf3
9 schema:genre chapter
10 schema:isAccessibleForFree true
11 schema:isPartOf N48d505362e40470badaea1ed524b12f2
12 schema:keywords Feistel schemes
13 Kfc
14 adversary
15 architecture
16 argument
17 assumption
18 attacks
19 better guidelines
20 block cipher
21 cipher
22 complexity
23 computational resources
24 construction
25 construction strategy
26 cryptographic primitives
27 design
28 design strategy
29 development
30 example C
31 guidelines
32 heuristic arguments
33 ideal construction
34 information-theoretic results
35 key size
36 limited range
37 little theory
38 new type
39 opposition
40 plausible assumptions
41 practice
42 primitives
43 proof
44 random Feistel schemes
45 range
46 reductionist security proof
47 resources
48 results
49 scheme
50 secure block cipher
51 security proof
52 situation
53 size
54 strategies
55 symmetric cryptographic primitives
56 symmetric primitives
57 theory
58 types
59 schema:name Building Secure Block Ciphers on Generic Attacks Assumptions
60 schema:pagination 66-81
61 schema:productId N72f57bf5218f4be3ab913f79aa9392c2
62 Na2c16abe5b9749b6a931dd57df79a21a
63 schema:publisher Nc9e85bc691ee42cd9fe6966b6110f9c2
64 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034497812
65 https://doi.org/10.1007/978-3-642-04159-4_5
66 schema:sdDatePublished 2022-11-24T21:19
67 schema:sdLicense https://scigraph.springernature.com/explorer/license/
68 schema:sdPublisher N8f227aadb752406d8469b6bf40411abb
69 schema:url https://doi.org/10.1007/978-3-642-04159-4_5
70 sgo:license sg:explorer/license/
71 sgo:sdDataset chapters
72 rdf:type schema:Chapter
73 N18207e87bc8c4a06bf9db47e8c3550e0 schema:familyName Keliher
74 schema:givenName Liam
75 rdf:type schema:Person
76 N24dccab3fde34379b1aa0735eeb8c521 rdf:first N18207e87bc8c4a06bf9db47e8c3550e0
77 rdf:rest N91b90309647440f7a4ca448e5612767b
78 N48d505362e40470badaea1ed524b12f2 schema:isbn 978-3-642-04158-7
79 978-3-642-04159-4
80 schema:name Selected Areas in Cryptography
81 rdf:type schema:Book
82 N4dcd9b6800f14decb8f3ab62e95f24d8 schema:familyName Sica
83 schema:givenName Francesco
84 rdf:type schema:Person
85 N4e9a5184cc2045409ae8be02d8620f89 schema:familyName Avanzi
86 schema:givenName Roberto Maria
87 rdf:type schema:Person
88 N72f57bf5218f4be3ab913f79aa9392c2 schema:name doi
89 schema:value 10.1007/978-3-642-04159-4_5
90 rdf:type schema:PropertyValue
91 N8f227aadb752406d8469b6bf40411abb schema:name Springer Nature - SN SciGraph project
92 rdf:type schema:Organization
93 N91b90309647440f7a4ca448e5612767b rdf:first N4dcd9b6800f14decb8f3ab62e95f24d8
94 rdf:rest rdf:nil
95 N9bbd524254494f0ba29c0ae7e137050d rdf:first sg:person.012254315647.07
96 rdf:rest Ndabec3346d0a4932814944c38399a2fa
97 Na2c16abe5b9749b6a931dd57df79a21a schema:name dimensions_id
98 schema:value pub.1034497812
99 rdf:type schema:PropertyValue
100 Nbcfed24ae2a948cb9eb2c8a14cc76cf3 rdf:first N4e9a5184cc2045409ae8be02d8620f89
101 rdf:rest N24dccab3fde34379b1aa0735eeb8c521
102 Nc9e85bc691ee42cd9fe6966b6110f9c2 schema:name Springer Nature
103 rdf:type schema:Organisation
104 Ndabec3346d0a4932814944c38399a2fa rdf:first sg:person.011724731171.01
105 rdf:rest rdf:nil
106 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
107 schema:name Information and Computing Sciences
108 rdf:type schema:DefinedTerm
109 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
110 schema:name Computation Theory and Mathematics
111 rdf:type schema:DefinedTerm
112 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
113 schema:name Data Format
114 rdf:type schema:DefinedTerm
115 sg:person.011724731171.01 schema:affiliation grid-institutes:grid.89485.38
116 schema:familyName Seurin
117 schema:givenName Yannick
118 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01
119 rdf:type schema:Person
120 sg:person.012254315647.07 schema:affiliation grid-institutes:grid.12832.3a
121 schema:familyName Patarin
122 schema:givenName Jacques
123 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012254315647.07
124 rdf:type schema:Person
125 grid-institutes:grid.12832.3a schema:alternateName University of Versailles, France
126 schema:name University of Versailles, France
127 rdf:type schema:Organization
128 grid-institutes:grid.89485.38 schema:alternateName Orange Labs, Issy-les-Moulineaux, France
129 schema:name Orange Labs, Issy-les-Moulineaux, France
130 University of Versailles, France
131 rdf:type schema:Organization
 




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


...