The Iterated Random Permutation Problem with Applications to Cascade Encryption View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2015-08-01

AUTHORS

Brice Minaud , Yannick Seurin

ABSTRACT

We introduce and study the iterated random permutation problem, which asks how hard it is to distinguish, in a black-box way, the r-th power of a random permutation from a uniformly random permutation of a set of size N. We show that this requires Ω(N)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varOmega (N)$$\end{document} queries (even for a two-sided, adaptive adversary). As a direct application of this result, we show that cascading a block cipher with the same key cannot degrade its security (as a pseudorandom permutation) more than negligibly. More... »

PAGES

351-367

Book

TITLE

Advances in Cryptology -- CRYPTO 2015

ISBN

978-3-662-47988-9
978-3-662-47989-6

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-47989-6_17

DOI

http://dx.doi.org/10.1007/978-3-662-47989-6_17

DIMENSIONS

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


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": "ANSSI, Paris, France", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ANSSI, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Minaud", 
        "givenName": "Brice", 
        "id": "sg:person.014163201426.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014163201426.70"
        ], 
        "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": "2015-08-01", 
    "datePublishedReg": "2015-08-01", 
    "description": "We introduce and study the iterated random permutation problem, which asks how hard it is to distinguish, in a black-box way, the r-th power of a random permutation from a uniformly random permutation of a set of size N. We show that this requires \u03a9(N)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$\\varOmega (N)$$\\end{document} queries (even for a two-sided, adaptive adversary). As a direct application of this result, we show that cascading a block cipher with the same key cannot degrade its security (as a pseudorandom permutation) more than negligibly.", 
    "editor": [
      {
        "familyName": "Gennaro", 
        "givenName": "Rosario", 
        "type": "Person"
      }, 
      {
        "familyName": "Robshaw", 
        "givenName": "Matthew", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-47989-6_17", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-47988-9", 
        "978-3-662-47989-6"
      ], 
      "name": "Advances in Cryptology -- CRYPTO 2015", 
      "type": "Book"
    }, 
    "keywords": [
      "permutation problem", 
      "black-box way", 
      "same key", 
      "cascade encryption", 
      "random permutation", 
      "block cipher", 
      "size n.", 
      "queries", 
      "encryption", 
      "r-th power", 
      "permutations", 
      "direct application", 
      "applications", 
      "cipher", 
      "security", 
      "problem", 
      "set", 
      "key", 
      "way", 
      "power", 
      "n.", 
      "results"
    ], 
    "name": "The Iterated Random Permutation Problem with Applications to Cascade Encryption", 
    "pagination": "351-367", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047706460"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-47989-6_17"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-47989-6_17", 
      "https://app.dimensions.ai/details/publication/pub.1047706460"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-11-24T21:13", 
    "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_203.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-47989-6_17"
  }
]
 

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-47989-6_17'

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-47989-6_17'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-47989-6_17'

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-47989-6_17'


 

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

93 TRIPLES      22 PREDICATES      46 URIs      39 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-47989-6_17 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N944498dc0d574727b3432155abaad601
4 schema:datePublished 2015-08-01
5 schema:datePublishedReg 2015-08-01
6 schema:description We introduce and study the iterated random permutation problem, which asks how hard it is to distinguish, in a black-box way, the r-th power of a random permutation from a uniformly random permutation of a set of size N. We show that this requires Ω(N)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varOmega (N)$$\end{document} queries (even for a two-sided, adaptive adversary). As a direct application of this result, we show that cascading a block cipher with the same key cannot degrade its security (as a pseudorandom permutation) more than negligibly.
7 schema:editor N413107afd40b41868f79200b6c5b47c2
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N9e491d6909084a92bab9147e5aee284b
11 schema:keywords applications
12 black-box way
13 block cipher
14 cascade encryption
15 cipher
16 direct application
17 encryption
18 key
19 n.
20 permutation problem
21 permutations
22 power
23 problem
24 queries
25 r-th power
26 random permutation
27 results
28 same key
29 security
30 set
31 size n.
32 way
33 schema:name The Iterated Random Permutation Problem with Applications to Cascade Encryption
34 schema:pagination 351-367
35 schema:productId N0f20a1a9f7494a8ea5e478088a5c3597
36 N24621812711b44f89a5a99b0a765a9a1
37 schema:publisher N93563f97ae044739bc4c3f8ef432b4a7
38 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047706460
39 https://doi.org/10.1007/978-3-662-47989-6_17
40 schema:sdDatePublished 2022-11-24T21:13
41 schema:sdLicense https://scigraph.springernature.com/explorer/license/
42 schema:sdPublisher N61f0f8d052d94a58990f7cea8a4f7425
43 schema:url https://doi.org/10.1007/978-3-662-47989-6_17
44 sgo:license sg:explorer/license/
45 sgo:sdDataset chapters
46 rdf:type schema:Chapter
47 N0f20a1a9f7494a8ea5e478088a5c3597 schema:name dimensions_id
48 schema:value pub.1047706460
49 rdf:type schema:PropertyValue
50 N12d14fc308dc43189deaa71f3aa68f0d schema:familyName Gennaro
51 schema:givenName Rosario
52 rdf:type schema:Person
53 N24621812711b44f89a5a99b0a765a9a1 schema:name doi
54 schema:value 10.1007/978-3-662-47989-6_17
55 rdf:type schema:PropertyValue
56 N413107afd40b41868f79200b6c5b47c2 rdf:first N12d14fc308dc43189deaa71f3aa68f0d
57 rdf:rest N89ab232de5fe4f118998cfb445792ac3
58 N61f0f8d052d94a58990f7cea8a4f7425 schema:name Springer Nature - SN SciGraph project
59 rdf:type schema:Organization
60 N88c9f80bba454c16a46cbdce2385f062 rdf:first sg:person.011724731171.01
61 rdf:rest rdf:nil
62 N89ab232de5fe4f118998cfb445792ac3 rdf:first Nedc3616f09f64e528ddac1bad823d6d7
63 rdf:rest rdf:nil
64 N93563f97ae044739bc4c3f8ef432b4a7 schema:name Springer Nature
65 rdf:type schema:Organisation
66 N944498dc0d574727b3432155abaad601 rdf:first sg:person.014163201426.70
67 rdf:rest N88c9f80bba454c16a46cbdce2385f062
68 N9e491d6909084a92bab9147e5aee284b schema:isbn 978-3-662-47988-9
69 978-3-662-47989-6
70 schema:name Advances in Cryptology -- CRYPTO 2015
71 rdf:type schema:Book
72 Nedc3616f09f64e528ddac1bad823d6d7 schema:familyName Robshaw
73 schema:givenName Matthew
74 rdf:type schema:Person
75 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
76 schema:name Information and Computing Sciences
77 rdf:type schema:DefinedTerm
78 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
79 schema:name Data Format
80 rdf:type schema:DefinedTerm
81 sg:person.011724731171.01 schema:affiliation grid-institutes:None
82 schema:familyName Seurin
83 schema:givenName Yannick
84 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01
85 rdf:type schema:Person
86 sg:person.014163201426.70 schema:affiliation grid-institutes:None
87 schema:familyName Minaud
88 schema:givenName Brice
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014163201426.70
90 rdf:type schema:Person
91 grid-institutes:None schema:alternateName ANSSI, Paris, France
92 schema:name ANSSI, Paris, France
93 rdf:type schema:Organization
 




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


...