Tweakable Blockciphers with Asymptotically Optimal Security View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2014-07-08

AUTHORS

Rodolphe Lampe , Yannick Seurin

ABSTRACT

We consider tweakable blockciphers with beyond the birthday bound security. Landecker, Shrimpton, and Terashima (CRYPTO 2012) gave the first construction with security up to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}(2^{2n/3})$$\end{document} adversarial queries (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document} denotes the block size in bits of the underlying blockcipher), and for which changing the tweak does not require changing the keys for blockcipher calls. In this paper, we extend this construction, which consists of two rounds of a previous proposal by Liskov, Rivest, and Wagner (CRYPTO 2002), by considering larger numbers of rounds \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r>2$$\end{document}. We show that asymptotically, as \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r$$\end{document} increases, the resulting tweakable blockcipher approaches security up to the information bound, namely \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}(2^n)$$\end{document} queries. Our analysis makes use of a coupling argument, and carries some similarities with the analysis of the iterated Even-Mansour cipher by Lampe, Patarin, and Seurin (ASIACRYPT 2012). More... »

PAGES

133-151

Book

TITLE

Fast Software Encryption

ISBN

978-3-662-43932-6
978-3-662-43933-3

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-43933-3_8

DOI

http://dx.doi.org/10.1007/978-3-662-43933-3_8

DIMENSIONS

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


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": "Lampe", 
        "givenName": "Rodolphe", 
        "id": "sg:person.013502647333.10", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013502647333.10"
        ], 
        "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": "2014-07-08", 
    "datePublishedReg": "2014-07-08", 
    "description": "We consider tweakable blockciphers with beyond the birthday bound security. Landecker, Shrimpton, and Terashima (CRYPTO 2012) gave the first construction with security up\u00a0to \\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}$$\\mathcal {O}(2^{2n/3})$$\\end{document} adversarial queries (\\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}$$n$$\\end{document} denotes the block size in bits of the underlying blockcipher), and for which changing the tweak does not require changing the keys for blockcipher calls. In this paper, we extend this construction, which consists of two rounds of a previous proposal by Liskov, Rivest, and Wagner (CRYPTO 2002), by considering larger numbers of rounds \\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}$$r>2$$\\end{document}. We show that asymptotically, as \\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}$$r$$\\end{document} increases, the resulting tweakable blockcipher approaches security up\u00a0to the information bound, namely \\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}$$\\mathcal {O}(2^n)$$\\end{document} queries. Our analysis makes use of a coupling argument, and carries some similarities with the analysis of the iterated Even-Mansour cipher by Lampe, Patarin, and Seurin (ASIACRYPT 2012).", 
    "editor": [
      {
        "familyName": "Moriai", 
        "givenName": "Shiho", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-43933-3_8", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-43932-6", 
        "978-3-662-43933-3"
      ], 
      "name": "Fast Software Encryption", 
      "type": "Book"
    }, 
    "keywords": [
      "tweakable blockcipher", 
      "security", 
      "adversarial queries", 
      "Even-Mansour cipher", 
      "optimal security", 
      "blockcipher", 
      "first construction", 
      "queries", 
      "blockcipher calls", 
      "previous proposals", 
      "Liskov", 
      "Rivest", 
      "large number", 
      "cipher", 
      "Shrimpton", 
      "Patarin", 
      "key", 
      "proposal", 
      "information", 
      "construction", 
      "Seurin", 
      "TWEAK", 
      "calls", 
      "rounds", 
      "Terashima", 
      "similarity", 
      "number", 
      "coupling argument", 
      "analysis", 
      "use", 
      "Wagner", 
      "argument", 
      "birthday", 
      "Lampe", 
      "paper"
    ], 
    "name": "Tweakable Blockciphers with Asymptotically Optimal Security", 
    "pagination": "133-151", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1037882606"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-43933-3_8"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-43933-3_8", 
      "https://app.dimensions.ai/details/publication/pub.1037882606"
    ], 
    "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_159.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-43933-3_8"
  }
]
 

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-43933-3_8'

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-43933-3_8'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-43933-3_8'

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-43933-3_8'


 

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

104 TRIPLES      22 PREDICATES      59 URIs      52 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-43933-3_8 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N2357f6c3b09049ab82f2f20d4ab2d693
4 schema:datePublished 2014-07-08
5 schema:datePublishedReg 2014-07-08
6 schema:description We consider tweakable blockciphers with beyond the birthday bound security. Landecker, Shrimpton, and Terashima (CRYPTO 2012) gave the first construction with security up to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}(2^{2n/3})$$\end{document} adversarial queries (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document} denotes the block size in bits of the underlying blockcipher), and for which changing the tweak does not require changing the keys for blockcipher calls. In this paper, we extend this construction, which consists of two rounds of a previous proposal by Liskov, Rivest, and Wagner (CRYPTO 2002), by considering larger numbers of rounds \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r>2$$\end{document}. We show that asymptotically, as \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r$$\end{document} increases, the resulting tweakable blockcipher approaches security up to the information bound, namely \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {O}(2^n)$$\end{document} queries. Our analysis makes use of a coupling argument, and carries some similarities with the analysis of the iterated Even-Mansour cipher by Lampe, Patarin, and Seurin (ASIACRYPT 2012).
7 schema:editor N02dd6710c4dd4f92a294992244cba1fe
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N41faa086e89a4148bac0f83d283fbc2d
11 schema:keywords Even-Mansour cipher
12 Lampe
13 Liskov
14 Patarin
15 Rivest
16 Seurin
17 Shrimpton
18 TWEAK
19 Terashima
20 Wagner
21 adversarial queries
22 analysis
23 argument
24 birthday
25 blockcipher
26 blockcipher calls
27 calls
28 cipher
29 construction
30 coupling argument
31 first construction
32 information
33 key
34 large number
35 number
36 optimal security
37 paper
38 previous proposals
39 proposal
40 queries
41 rounds
42 security
43 similarity
44 tweakable blockcipher
45 use
46 schema:name Tweakable Blockciphers with Asymptotically Optimal Security
47 schema:pagination 133-151
48 schema:productId N7c1f683e46854be8ad80dc06f353c998
49 N8cc62cae954345a7a08e9cbac79109a2
50 schema:publisher N28b9a573de614ac68cd39a650a9e7b06
51 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037882606
52 https://doi.org/10.1007/978-3-662-43933-3_8
53 schema:sdDatePublished 2022-12-01T06:47
54 schema:sdLicense https://scigraph.springernature.com/explorer/license/
55 schema:sdPublisher Ne647338af99d4b3d8e50c661dfad766f
56 schema:url https://doi.org/10.1007/978-3-662-43933-3_8
57 sgo:license sg:explorer/license/
58 sgo:sdDataset chapters
59 rdf:type schema:Chapter
60 N02dd6710c4dd4f92a294992244cba1fe rdf:first N799f98cc88fc47f3a1fea1b2d5e63ee3
61 rdf:rest rdf:nil
62 N2357f6c3b09049ab82f2f20d4ab2d693 rdf:first sg:person.013502647333.10
63 rdf:rest N9b35ba10a0bc4779a621aaaf0e2f8f35
64 N28b9a573de614ac68cd39a650a9e7b06 schema:name Springer Nature
65 rdf:type schema:Organisation
66 N41faa086e89a4148bac0f83d283fbc2d schema:isbn 978-3-662-43932-6
67 978-3-662-43933-3
68 schema:name Fast Software Encryption
69 rdf:type schema:Book
70 N799f98cc88fc47f3a1fea1b2d5e63ee3 schema:familyName Moriai
71 schema:givenName Shiho
72 rdf:type schema:Person
73 N7c1f683e46854be8ad80dc06f353c998 schema:name dimensions_id
74 schema:value pub.1037882606
75 rdf:type schema:PropertyValue
76 N8cc62cae954345a7a08e9cbac79109a2 schema:name doi
77 schema:value 10.1007/978-3-662-43933-3_8
78 rdf:type schema:PropertyValue
79 N9b35ba10a0bc4779a621aaaf0e2f8f35 rdf:first sg:person.011724731171.01
80 rdf:rest rdf:nil
81 Ne647338af99d4b3d8e50c661dfad766f schema:name Springer Nature - SN SciGraph project
82 rdf:type schema:Organization
83 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
84 schema:name Information and Computing Sciences
85 rdf:type schema:DefinedTerm
86 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
87 schema:name Data Format
88 rdf:type schema:DefinedTerm
89 sg:person.011724731171.01 schema:affiliation grid-institutes:None
90 schema:familyName Seurin
91 schema:givenName Yannick
92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011724731171.01
93 rdf:type schema:Person
94 sg:person.013502647333.10 schema:affiliation grid-institutes:grid.12832.3a
95 schema:familyName Lampe
96 schema:givenName Rodolphe
97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013502647333.10
98 rdf:type schema:Person
99 grid-institutes:None schema:alternateName ANSSI, Paris, France
100 schema:name ANSSI, Paris, France
101 rdf:type schema:Organization
102 grid-institutes:grid.12832.3a schema:alternateName University of Versailles, Versailles, France
103 schema:name University of Versailles, Versailles, France
104 rdf:type schema:Organization
 




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


...