Robust Authenticated Encryption and the Limits of Symmetric Cryptography View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2015-12-08

AUTHORS

Christian Badertscher , Christian Matt , Ueli Maurer , Phillip Rogaway , Björn Tackmann

ABSTRACT

Robust authenticated encryption (RAE) is a primitive for symmetric encryption that allows to flexibly specify the ciphertext expansion, i.e., how much longer the ciphertext is compared to the plaintext. For every ciphertext expansion, RAE aims at providing the best-possible authenticity and confidentiality. To investigate whether this is actually achieved, we characterize exactly the guarantees symmetric cryptography can provide for any given ciphertext expansion. Our characterization reveals not only that RAE reaches the claimed goal, but also, contrary to prior belief, that one cannot achieve full confidentiality without ciphertext expansion. This provides new insights into the limits of symmetric cryptography.Moreover, we provide a rigorous treatment of two previously only informally stated additional features of RAE; namely, we show how redundancy in the message space can be exploited to improve the security and we analyze the exact security loss if multiple messages are encrypted with the same nonce. More... »

PAGES

112-129

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-27239-9_7

DOI

http://dx.doi.org/10.1007/978-3-319-27239-9_7

DIMENSIONS

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


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": "Department of Computer Science, ETH Zurich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Badertscher", 
        "givenName": "Christian", 
        "id": "sg:person.010232721040.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010232721040.24"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Matt", 
        "givenName": "Christian", 
        "id": "sg:person.014520474132.60", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014520474132.60"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maurer", 
        "givenName": "Ueli", 
        "id": "sg:person.01316567627.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of California, Davis, USA", 
          "id": "http://www.grid.ac/institutes/grid.27860.3b", 
          "name": [
            "Department of Computer Science, University of California, Davis, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rogaway", 
        "givenName": "Phillip", 
        "id": "sg:person.014475776464.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014475776464.03"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, University of California, San Diego, USA", 
          "id": "http://www.grid.ac/institutes/grid.266100.3", 
          "name": [
            "Department of Computer Science and Engineering, University of California, San Diego, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tackmann", 
        "givenName": "Bj\u00f6rn", 
        "id": "sg:person.07617171521.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-12-08", 
    "datePublishedReg": "2015-12-08", 
    "description": "Robust authenticated encryption (RAE) is a primitive for symmetric encryption that allows to flexibly specify the ciphertext expansion, i.e., how much longer the ciphertext is compared to the plaintext. For every ciphertext expansion, RAE aims at providing the best-possible authenticity and confidentiality. To investigate whether this is actually achieved, we characterize exactly the guarantees symmetric cryptography can provide for any given ciphertext expansion. Our characterization reveals not only that RAE reaches the claimed goal, but also, contrary to prior belief, that one cannot achieve full confidentiality without ciphertext expansion. This provides new insights into the limits of symmetric cryptography.Moreover, we provide a rigorous treatment of two previously only informally stated additional features of RAE; namely, we show how redundancy in the message space can be exploited to improve the security and we analyze the exact security loss if multiple messages are encrypted with the same nonce.", 
    "editor": [
      {
        "familyName": "Groth", 
        "givenName": "Jens", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-27239-9_7", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-319-27238-2", 
        "978-3-319-27239-9"
      ], 
      "name": "Cryptography and Coding", 
      "type": "Book"
    }, 
    "keywords": [
      "symmetric cryptography", 
      "ciphertext expansion", 
      "symmetric encryption", 
      "Authenticated Encryption", 
      "encryption", 
      "cryptography", 
      "full confidentiality", 
      "security loss", 
      "multiple messages", 
      "same nonce", 
      "message space", 
      "confidentiality", 
      "additional features", 
      "ciphertext", 
      "primitives", 
      "plaintext", 
      "nonce", 
      "security", 
      "redundancy", 
      "messages", 
      "authenticity", 
      "goal", 
      "features", 
      "space", 
      "prior beliefs", 
      "rigorous treatment", 
      "one", 
      "RAE", 
      "insights", 
      "expansion", 
      "new insights", 
      "limit", 
      "loss", 
      "beliefs", 
      "characterization", 
      "treatment"
    ], 
    "name": "Robust Authenticated Encryption and the Limits of Symmetric Cryptography", 
    "pagination": "112-129", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044309865"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-27239-9_7"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-27239-9_7", 
      "https://app.dimensions.ai/details/publication/pub.1044309865"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:47", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_330.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-27239-9_7"
  }
]
 

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-319-27239-9_7'

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-319-27239-9_7'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-27239-9_7'

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-319-27239-9_7'


 

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

130 TRIPLES      23 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-27239-9_7 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N1ba4cb818d174a7ea84869310ac9c616
4 schema:datePublished 2015-12-08
5 schema:datePublishedReg 2015-12-08
6 schema:description Robust authenticated encryption (RAE) is a primitive for symmetric encryption that allows to flexibly specify the ciphertext expansion, i.e., how much longer the ciphertext is compared to the plaintext. For every ciphertext expansion, RAE aims at providing the best-possible authenticity and confidentiality. To investigate whether this is actually achieved, we characterize exactly the guarantees symmetric cryptography can provide for any given ciphertext expansion. Our characterization reveals not only that RAE reaches the claimed goal, but also, contrary to prior belief, that one cannot achieve full confidentiality without ciphertext expansion. This provides new insights into the limits of symmetric cryptography.Moreover, we provide a rigorous treatment of two previously only informally stated additional features of RAE; namely, we show how redundancy in the message space can be exploited to improve the security and we analyze the exact security loss if multiple messages are encrypted with the same nonce.
7 schema:editor N82d05669312b4498b4a54838a6ef8397
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N2773cad32f2a46dfac9baf95db75e5f5
12 schema:keywords Authenticated Encryption
13 RAE
14 additional features
15 authenticity
16 beliefs
17 characterization
18 ciphertext
19 ciphertext expansion
20 confidentiality
21 cryptography
22 encryption
23 expansion
24 features
25 full confidentiality
26 goal
27 insights
28 limit
29 loss
30 message space
31 messages
32 multiple messages
33 new insights
34 nonce
35 one
36 plaintext
37 primitives
38 prior beliefs
39 redundancy
40 rigorous treatment
41 same nonce
42 security
43 security loss
44 space
45 symmetric cryptography
46 symmetric encryption
47 treatment
48 schema:name Robust Authenticated Encryption and the Limits of Symmetric Cryptography
49 schema:pagination 112-129
50 schema:productId N795384e94b1b45038c73c1602dadb222
51 Na3ccbba89b874295b7827e8b2020cd36
52 schema:publisher N2e93e4646b8b45e89a0a903d0a45f563
53 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044309865
54 https://doi.org/10.1007/978-3-319-27239-9_7
55 schema:sdDatePublished 2022-05-10T10:47
56 schema:sdLicense https://scigraph.springernature.com/explorer/license/
57 schema:sdPublisher N5613ca19d9144d66a37f4d0670079948
58 schema:url https://doi.org/10.1007/978-3-319-27239-9_7
59 sgo:license sg:explorer/license/
60 sgo:sdDataset chapters
61 rdf:type schema:Chapter
62 N1ba4cb818d174a7ea84869310ac9c616 rdf:first sg:person.010232721040.24
63 rdf:rest N7a425c544d0c42e7a3ae70ecab4bc14f
64 N2773cad32f2a46dfac9baf95db75e5f5 schema:isbn 978-3-319-27238-2
65 978-3-319-27239-9
66 schema:name Cryptography and Coding
67 rdf:type schema:Book
68 N2e93e4646b8b45e89a0a903d0a45f563 schema:name Springer Nature
69 rdf:type schema:Organisation
70 N38581c4b38a144049c63ed05662aa5d0 schema:familyName Groth
71 schema:givenName Jens
72 rdf:type schema:Person
73 N5613ca19d9144d66a37f4d0670079948 schema:name Springer Nature - SN SciGraph project
74 rdf:type schema:Organization
75 N66c125a8b71c430aa0aab29b630d627a rdf:first sg:person.014475776464.03
76 rdf:rest Nb18aa070e8db4f52912bbc8c83ec8d22
77 N795384e94b1b45038c73c1602dadb222 schema:name doi
78 schema:value 10.1007/978-3-319-27239-9_7
79 rdf:type schema:PropertyValue
80 N7a425c544d0c42e7a3ae70ecab4bc14f rdf:first sg:person.014520474132.60
81 rdf:rest Nb57616b40e25438f96e82c0854db846b
82 N82d05669312b4498b4a54838a6ef8397 rdf:first N38581c4b38a144049c63ed05662aa5d0
83 rdf:rest rdf:nil
84 Na3ccbba89b874295b7827e8b2020cd36 schema:name dimensions_id
85 schema:value pub.1044309865
86 rdf:type schema:PropertyValue
87 Nb18aa070e8db4f52912bbc8c83ec8d22 rdf:first sg:person.07617171521.69
88 rdf:rest rdf:nil
89 Nb57616b40e25438f96e82c0854db846b rdf:first sg:person.01316567627.91
90 rdf:rest N66c125a8b71c430aa0aab29b630d627a
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.010232721040.24 schema:affiliation grid-institutes:grid.5801.c
98 schema:familyName Badertscher
99 schema:givenName Christian
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010232721040.24
101 rdf:type schema:Person
102 sg:person.01316567627.91 schema:affiliation grid-institutes:grid.5801.c
103 schema:familyName Maurer
104 schema:givenName Ueli
105 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91
106 rdf:type schema:Person
107 sg:person.014475776464.03 schema:affiliation grid-institutes:grid.27860.3b
108 schema:familyName Rogaway
109 schema:givenName Phillip
110 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014475776464.03
111 rdf:type schema:Person
112 sg:person.014520474132.60 schema:affiliation grid-institutes:grid.5801.c
113 schema:familyName Matt
114 schema:givenName Christian
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014520474132.60
116 rdf:type schema:Person
117 sg:person.07617171521.69 schema:affiliation grid-institutes:grid.266100.3
118 schema:familyName Tackmann
119 schema:givenName Björn
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69
121 rdf:type schema:Person
122 grid-institutes:grid.266100.3 schema:alternateName Department of Computer Science and Engineering, University of California, San Diego, USA
123 schema:name Department of Computer Science and Engineering, University of California, San Diego, USA
124 rdf:type schema:Organization
125 grid-institutes:grid.27860.3b schema:alternateName Department of Computer Science, University of California, Davis, USA
126 schema:name Department of Computer Science, University of California, Davis, USA
127 rdf:type schema:Organization
128 grid-institutes:grid.5801.c schema:alternateName Department of Computer Science, ETH Zurich, Zurich, Switzerland
129 schema:name Department of Computer Science, ETH Zurich, Zurich, Switzerland
130 rdf:type schema:Organization
 




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


...