Strengthening the Known-Key Security Notion for Block Ciphers View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2016-07-20

AUTHORS

Benoît Cogliati , Yannick Seurin

ABSTRACT

We reconsider the formalization of known-key attacks against ideal primitive-based block ciphers. This was previously tackled by Andreeva, Bogdanov, and Mennink (FSE 2013), who introduced the notion of known-key indifferentiability. Our starting point is the observation, previously made by Cogliati and Seurin (EUROCRYPT 2015), that this notion, which considers only a single known key available to the attacker, is too weak in some settings to fully capture what one might expect from a block cipher informally deemed resistant to known-key attacks. Hence, we introduce a stronger variant of known-key indifferentiability, where the adversary is given multiple known keys to “play” with, the informal goal being that the block cipher construction must behave as an independent random permutation for each of these known keys. Our main result is that the 9-round iterated Even-Mansour construction (with the trivial key-schedule, i.e., the same round key xored between permutations) achieves our new “multiple” known-keys indifferentiability notion, which contrasts with the previous result of Andreeva et al. that one single round is sufficient when only a single known key is considered. We also show that the 3-round iterated Even-Mansour construction achieves the weaker notion of multiple known-keys sequential indifferentiability, which implies in particular that it is correlation intractable with respect to relations involving any (polynomial) number of known keys. More... »

PAGES

494-513

Book

TITLE

Fast Software Encryption

ISBN

978-3-662-52992-8
978-3-662-52993-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-52993-5_25

DOI

http://dx.doi.org/10.1007/978-3-662-52993-5_25

DIMENSIONS

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


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": "University of Versailles, Versailles, France", 
          "id": "http://www.grid.ac/institutes/grid.12832.3a", 
          "name": [
            "University of Versailles, Versailles, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Cogliati", 
        "givenName": "Beno\u00eet", 
        "id": "sg:person.010731237165.96", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010731237165.96"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ANSSI, Paris, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ANSSI, Paris, 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": "2016-07-20", 
    "datePublishedReg": "2016-07-20", 
    "description": "We reconsider the formalization of known-key attacks against ideal primitive-based block ciphers. This was previously tackled by Andreeva, Bogdanov, and Mennink (FSE\u00a02013), who introduced the notion of known-key indifferentiability. Our starting point is the observation, previously made by Cogliati and Seurin (EUROCRYPT\u00a02015), that this notion, which considers only a single known key available to the attacker, is too weak in some settings to fully capture what one might expect from a block cipher informally deemed resistant to known-key attacks. Hence, we introduce a stronger variant of known-key indifferentiability, where the adversary is given multiple known keys to \u201cplay\u201d with, the informal goal being that the block cipher construction must behave as an independent random permutation for each of these known keys. Our main result is that the 9-round iterated Even-Mansour construction (with the trivial key-schedule, i.e., the same round key xored between permutations) achieves our new \u201cmultiple\u201d known-keys indifferentiability notion, which contrasts with the previous result of Andreeva et al. that one single round is sufficient when only a single known key is considered. We also show that the 3-round iterated Even-Mansour construction achieves the weaker notion of multiple known-keys sequential indifferentiability, which implies in particular that it is correlation intractable with respect to relations involving any (polynomial) number of known keys.", 
    "editor": [
      {
        "familyName": "Peyrin", 
        "givenName": "Thomas", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-52993-5_25", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-52992-8", 
        "978-3-662-52993-5"
      ], 
      "name": "Fast Software Encryption", 
      "type": "Book"
    }, 
    "keywords": [
      "known-key attacks", 
      "block cipher", 
      "Even-Mansour construction", 
      "cipher", 
      "block cipher construction", 
      "Andreeva et al", 
      "security notions", 
      "attacks", 
      "indifferentiability", 
      "key", 
      "stronger variant", 
      "random permutation", 
      "weaker notion", 
      "formalization", 
      "attacker", 
      "adversary", 
      "informal goals", 
      "single round", 
      "Mennink", 
      "notion", 
      "starting point", 
      "Seurin", 
      "goal", 
      "construction", 
      "permutations", 
      "Andreeva", 
      "Bogdanov", 
      "point", 
      "setting", 
      "variants", 
      "main results", 
      "results", 
      "previous results", 
      "et al", 
      "rounds", 
      "respect", 
      "relation", 
      "number", 
      "observations", 
      "al", 
      "correlation", 
      "Cogliati", 
      "independent random permutations"
    ], 
    "name": "Strengthening the Known-Key Security Notion for Block Ciphers", 
    "pagination": "494-513", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1034013858"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-52993-5_25"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-52993-5_25", 
      "https://app.dimensions.ai/details/publication/pub.1034013858"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-12-01T06:47", 
    "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_135.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-52993-5_25"
  }
]
 

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-52993-5_25'

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-52993-5_25'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-52993-5_25'

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-52993-5_25'


 

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

112 TRIPLES      22 PREDICATES      67 URIs      60 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-52993-5_25 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N95428de669a0458db0ef88c3b45373d0
4 schema:datePublished 2016-07-20
5 schema:datePublishedReg 2016-07-20
6 schema:description We reconsider the formalization of known-key attacks against ideal primitive-based block ciphers. This was previously tackled by Andreeva, Bogdanov, and Mennink (FSE 2013), who introduced the notion of known-key indifferentiability. Our starting point is the observation, previously made by Cogliati and Seurin (EUROCRYPT 2015), that this notion, which considers only a single known key available to the attacker, is too weak in some settings to fully capture what one might expect from a block cipher informally deemed resistant to known-key attacks. Hence, we introduce a stronger variant of known-key indifferentiability, where the adversary is given multiple known keys to “play” with, the informal goal being that the block cipher construction must behave as an independent random permutation for each of these known keys. Our main result is that the 9-round iterated Even-Mansour construction (with the trivial key-schedule, i.e., the same round key xored between permutations) achieves our new “multiple” known-keys indifferentiability notion, which contrasts with the previous result of Andreeva et al. that one single round is sufficient when only a single known key is considered. We also show that the 3-round iterated Even-Mansour construction achieves the weaker notion of multiple known-keys sequential indifferentiability, which implies in particular that it is correlation intractable with respect to relations involving any (polynomial) number of known keys.
7 schema:editor N167d60b9faaa4de29ba64b50cb9b2e4e
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf Nc54602af7c2848d59854d3496ee9ec64
11 schema:keywords Andreeva
12 Andreeva et al
13 Bogdanov
14 Cogliati
15 Even-Mansour construction
16 Mennink
17 Seurin
18 adversary
19 al
20 attacker
21 attacks
22 block cipher
23 block cipher construction
24 cipher
25 construction
26 correlation
27 et al
28 formalization
29 goal
30 independent random permutations
31 indifferentiability
32 informal goals
33 key
34 known-key attacks
35 main results
36 notion
37 number
38 observations
39 permutations
40 point
41 previous results
42 random permutation
43 relation
44 respect
45 results
46 rounds
47 security notions
48 setting
49 single round
50 starting point
51 stronger variant
52 variants
53 weaker notion
54 schema:name Strengthening the Known-Key Security Notion for Block Ciphers
55 schema:pagination 494-513
56 schema:productId N062c7cf9b1254a6badc7febf9ca20d5e
57 N82901114686d48e3a6f253318736836c
58 schema:publisher N4efbb1c2ef324be6951b08a506ea5dbb
59 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034013858
60 https://doi.org/10.1007/978-3-662-52993-5_25
61 schema:sdDatePublished 2022-12-01T06:47
62 schema:sdLicense https://scigraph.springernature.com/explorer/license/
63 schema:sdPublisher Nc0776964baf94c998af773f8b15a3747
64 schema:url https://doi.org/10.1007/978-3-662-52993-5_25
65 sgo:license sg:explorer/license/
66 sgo:sdDataset chapters
67 rdf:type schema:Chapter
68 N062c7cf9b1254a6badc7febf9ca20d5e schema:name doi
69 schema:value 10.1007/978-3-662-52993-5_25
70 rdf:type schema:PropertyValue
71 N0704b928a59b464cac1979c940dde009 schema:familyName Peyrin
72 schema:givenName Thomas
73 rdf:type schema:Person
74 N167d60b9faaa4de29ba64b50cb9b2e4e rdf:first N0704b928a59b464cac1979c940dde009
75 rdf:rest rdf:nil
76 N4efbb1c2ef324be6951b08a506ea5dbb schema:name Springer Nature
77 rdf:type schema:Organisation
78 N82901114686d48e3a6f253318736836c schema:name dimensions_id
79 schema:value pub.1034013858
80 rdf:type schema:PropertyValue
81 N95428de669a0458db0ef88c3b45373d0 rdf:first sg:person.010731237165.96
82 rdf:rest Nf8d6b9db4d8c490999a11c4b3ef0407a
83 Nc0776964baf94c998af773f8b15a3747 schema:name Springer Nature - SN SciGraph project
84 rdf:type schema:Organization
85 Nc54602af7c2848d59854d3496ee9ec64 schema:isbn 978-3-662-52992-8
86 978-3-662-52993-5
87 schema:name Fast Software Encryption
88 rdf:type schema:Book
89 Nf8d6b9db4d8c490999a11c4b3ef0407a rdf:first sg:person.011724731171.01
90 rdf:rest rdf:nil
91 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
92 schema:name Information and Computing Sciences
93 rdf:type schema:DefinedTerm
94 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
95 schema:name Data Format
96 rdf:type schema:DefinedTerm
97 sg:person.010731237165.96 schema:affiliation grid-institutes:grid.12832.3a
98 schema:familyName Cogliati
99 schema:givenName Benoît
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010731237165.96
101 rdf:type schema:Person
102 sg:person.011724731171.01 schema:affiliation grid-institutes:None
103 schema:familyName Seurin
104 schema:givenName Yannick
105 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01
106 rdf:type schema:Person
107 grid-institutes:None schema:alternateName ANSSI, Paris, France
108 schema:name ANSSI, Paris, France
109 rdf:type schema:Organization
110 grid-institutes:grid.12832.3a schema:alternateName University of Versailles, Versailles, France
111 schema:name University of Versailles, Versailles, France
112 rdf:type schema:Organization
 




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


...