Memory Erasability Amplification View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2016-08-11

AUTHORS

Jan Camenisch , Robert R. Enderlein , Ueli Maurer

ABSTRACT

Erasable memory is an important resource for designing practical cryptographic protocols that are secure against adaptive attacks. Many practical memory devices such as solid state drives, hard disks, or file systems are not perfectly erasable because a deletion operation leaves traces of the deleted data in the system. A number of methods for constructing a large erasable memory from a small one, e.g., using encryption, have been proposed. Despite the importance of erasable memory in cryptography, no formal model has been proposed that allows one to formally analyse such memory constructions or cryptographic protocols relying on erasable memory.The contribution of this paper is three-fold. First, we provide a formal model of erasable memory. A memory device allows a user to store, retrieve, and delete data, and it is characterised by a leakage function defining the extent to which erased data is still accessible to an adversary.Second, we investigate how the erasability of such memories can be amplified. We provide a number of constructions of memories with strong erasability guarantees from memories with weaker guarantees. One of these constructions of perfectly erasable memories from imperfectly erasable ones can be considered as the prototypical application of Canetti et al.’s All-or-Nothing Transform (AoNT). Motivated by this construction, we propose some new and better AoNTs that are either perfectly or computationally secure. These AoNTs are of possible independent interest.Third, we show (in the constructive cryptography framework) how the construction of erasable memory and its use in cryptographic protocols (for example to achieve adaptive security) can naturally be composed to obtain provable security of the overall protocol. More... »

PAGES

104-125

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-44618-9_6

DOI

http://dx.doi.org/10.1007/978-3-319-44618-9_6

DIMENSIONS

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


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/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "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": "IBM Research - Zurich, Rueschlikon, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.410387.9", 
          "name": [
            "IBM Research - Zurich, Rueschlikon, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Camenisch", 
        "givenName": "Jan", 
        "id": "sg:person.012724170225.53", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012724170225.53"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "IBM Research - Zurich, Rueschlikon, Switzerland", 
            "Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Enderlein", 
        "givenName": "Robert R.", 
        "id": "sg:person.013021434071.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013021434071.43"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Z\u00fcrich, 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"
      }
    ], 
    "datePublished": "2016-08-11", 
    "datePublishedReg": "2016-08-11", 
    "description": "Erasable memory is an important resource for designing practical cryptographic protocols that are secure against adaptive attacks. Many practical memory devices such as solid state drives, hard disks, or file systems are not perfectly erasable because a deletion operation leaves traces of the deleted data in the system. A number of methods for constructing a large erasable memory from a small one, e.g., using encryption, have been proposed. Despite the importance of erasable memory in cryptography, no formal model has been proposed that allows one to formally analyse such memory constructions or cryptographic protocols relying on erasable memory.The contribution of this paper is three-fold. First, we provide a formal model of erasable memory. A memory device allows a user to store, retrieve, and delete data, and it is characterised by a leakage function defining the extent to which erased data is still accessible to an adversary.Second, we investigate how the erasability of such memories can be amplified. We provide a number of constructions of memories with strong erasability guarantees from memories with weaker guarantees. One of these constructions of perfectly erasable memories from imperfectly erasable ones can be considered as the prototypical application of Canetti et al.\u2019s All-or-Nothing Transform (AoNT). Motivated by this construction, we propose some new and better AoNTs that are either perfectly or computationally secure. These AoNTs are of possible independent interest.Third, we show (in the constructive cryptography framework) how the construction of erasable memory and its use in cryptographic protocols (for example to achieve adaptive security) can naturally be composed to obtain provable security of the overall protocol.", 
    "editor": [
      {
        "familyName": "Zikas", 
        "givenName": "Vassilis", 
        "type": "Person"
      }, 
      {
        "familyName": "De Prisco", 
        "givenName": "Roberto", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-44618-9_6", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-44617-2", 
        "978-3-319-44618-9"
      ], 
      "name": "Security and Cryptography for Networks", 
      "type": "Book"
    }, 
    "keywords": [
      "cryptographic protocols", 
      "formal model", 
      "practical cryptographic protocols", 
      "solid-state drives", 
      "erasable memory", 
      "adaptive attacks", 
      "file system", 
      "provable security", 
      "state drives", 
      "weaker guarantees", 
      "deletion operations", 
      "prototypical application", 
      "leakage function", 
      "possible independent interest", 
      "hard disk", 
      "AONT", 
      "practical memory devices", 
      "independent interest", 
      "guarantees", 
      "number of methods", 
      "number of constructions", 
      "encryption", 
      "protocol", 
      "cryptography", 
      "adversary", 
      "memory", 
      "users", 
      "security", 
      "Canetti", 
      "such memories", 
      "memory construction", 
      "devices", 
      "attacks", 
      "system", 
      "memory devices", 
      "construction", 
      "three-fold", 
      "data", 
      "important resource", 
      "resources", 
      "model", 
      "applications", 
      "overall protocol", 
      "traces", 
      "operation", 
      "transform", 
      "one", 
      "number", 
      "smaller ones", 
      "erasability", 
      "method", 
      "drive", 
      "interest", 
      "use", 
      "contribution", 
      "function", 
      "importance", 
      "disk", 
      "al", 
      "extent", 
      "amplification", 
      "paper"
    ], 
    "name": "Memory Erasability Amplification", 
    "pagination": "104-125", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047851737"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-44618-9_6"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-44618-9_6", 
      "https://app.dimensions.ai/details/publication/pub.1047851737"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:47", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_386.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-44618-9_6"
  }
]
 

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-44618-9_6'

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-44618-9_6'

Turtle is a human-readable linked data format.

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

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-44618-9_6'


 

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

153 TRIPLES      23 PREDICATES      89 URIs      80 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-44618-9_6 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 anzsrc-for:0803
4 anzsrc-for:0804
5 schema:author N8c676b980e8940d5a697f72beb566f6f
6 schema:datePublished 2016-08-11
7 schema:datePublishedReg 2016-08-11
8 schema:description Erasable memory is an important resource for designing practical cryptographic protocols that are secure against adaptive attacks. Many practical memory devices such as solid state drives, hard disks, or file systems are not perfectly erasable because a deletion operation leaves traces of the deleted data in the system. A number of methods for constructing a large erasable memory from a small one, e.g., using encryption, have been proposed. Despite the importance of erasable memory in cryptography, no formal model has been proposed that allows one to formally analyse such memory constructions or cryptographic protocols relying on erasable memory.The contribution of this paper is three-fold. First, we provide a formal model of erasable memory. A memory device allows a user to store, retrieve, and delete data, and it is characterised by a leakage function defining the extent to which erased data is still accessible to an adversary.Second, we investigate how the erasability of such memories can be amplified. We provide a number of constructions of memories with strong erasability guarantees from memories with weaker guarantees. One of these constructions of perfectly erasable memories from imperfectly erasable ones can be considered as the prototypical application of Canetti et al.’s All-or-Nothing Transform (AoNT). Motivated by this construction, we propose some new and better AoNTs that are either perfectly or computationally secure. These AoNTs are of possible independent interest.Third, we show (in the constructive cryptography framework) how the construction of erasable memory and its use in cryptographic protocols (for example to achieve adaptive security) can naturally be composed to obtain provable security of the overall protocol.
9 schema:editor Ne1ef79f3403a42e9962e194353291c34
10 schema:genre chapter
11 schema:inLanguage en
12 schema:isAccessibleForFree false
13 schema:isPartOf N90a29a4383bc465d850908845569222e
14 schema:keywords AONT
15 Canetti
16 adaptive attacks
17 adversary
18 al
19 amplification
20 applications
21 attacks
22 construction
23 contribution
24 cryptographic protocols
25 cryptography
26 data
27 deletion operations
28 devices
29 disk
30 drive
31 encryption
32 erasability
33 erasable memory
34 extent
35 file system
36 formal model
37 function
38 guarantees
39 hard disk
40 importance
41 important resource
42 independent interest
43 interest
44 leakage function
45 memory
46 memory construction
47 memory devices
48 method
49 model
50 number
51 number of constructions
52 number of methods
53 one
54 operation
55 overall protocol
56 paper
57 possible independent interest
58 practical cryptographic protocols
59 practical memory devices
60 protocol
61 prototypical application
62 provable security
63 resources
64 security
65 smaller ones
66 solid-state drives
67 state drives
68 such memories
69 system
70 three-fold
71 traces
72 transform
73 use
74 users
75 weaker guarantees
76 schema:name Memory Erasability Amplification
77 schema:pagination 104-125
78 schema:productId Nb28c34697da44b2cb8c40982c40a5082
79 Ne240d95a66934da7a83801f7021fa1ae
80 schema:publisher N7063149d3c2a458f944ac3ddd4f7eb7e
81 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047851737
82 https://doi.org/10.1007/978-3-319-44618-9_6
83 schema:sdDatePublished 2022-05-20T07:47
84 schema:sdLicense https://scigraph.springernature.com/explorer/license/
85 schema:sdPublisher Nad204e3f86944c109d78765792836345
86 schema:url https://doi.org/10.1007/978-3-319-44618-9_6
87 sgo:license sg:explorer/license/
88 sgo:sdDataset chapters
89 rdf:type schema:Chapter
90 N116976e3d5b244d3ad0c71a5bd4980fa schema:familyName De Prisco
91 schema:givenName Roberto
92 rdf:type schema:Person
93 N294b40f48fbd4e05820f826581578e5c rdf:first N116976e3d5b244d3ad0c71a5bd4980fa
94 rdf:rest rdf:nil
95 N7063149d3c2a458f944ac3ddd4f7eb7e schema:name Springer Nature
96 rdf:type schema:Organisation
97 N8c676b980e8940d5a697f72beb566f6f rdf:first sg:person.012724170225.53
98 rdf:rest Nb742e29ce853418480a84edaf844196b
99 N90a29a4383bc465d850908845569222e schema:isbn 978-3-319-44617-2
100 978-3-319-44618-9
101 schema:name Security and Cryptography for Networks
102 rdf:type schema:Book
103 Nad204e3f86944c109d78765792836345 schema:name Springer Nature - SN SciGraph project
104 rdf:type schema:Organization
105 Nb28c34697da44b2cb8c40982c40a5082 schema:name dimensions_id
106 schema:value pub.1047851737
107 rdf:type schema:PropertyValue
108 Nb742e29ce853418480a84edaf844196b rdf:first sg:person.013021434071.43
109 rdf:rest Nf666abc6442f44df984c5ed87eab782f
110 Nbea0a995940041869d34551da6c53181 schema:familyName Zikas
111 schema:givenName Vassilis
112 rdf:type schema:Person
113 Ne1ef79f3403a42e9962e194353291c34 rdf:first Nbea0a995940041869d34551da6c53181
114 rdf:rest N294b40f48fbd4e05820f826581578e5c
115 Ne240d95a66934da7a83801f7021fa1ae schema:name doi
116 schema:value 10.1007/978-3-319-44618-9_6
117 rdf:type schema:PropertyValue
118 Nf666abc6442f44df984c5ed87eab782f rdf:first sg:person.01316567627.91
119 rdf:rest rdf:nil
120 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
121 schema:name Information and Computing Sciences
122 rdf:type schema:DefinedTerm
123 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
124 schema:name Computation Theory and Mathematics
125 rdf:type schema:DefinedTerm
126 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
127 schema:name Computer Software
128 rdf:type schema:DefinedTerm
129 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
130 schema:name Data Format
131 rdf:type schema:DefinedTerm
132 sg:person.012724170225.53 schema:affiliation grid-institutes:grid.410387.9
133 schema:familyName Camenisch
134 schema:givenName Jan
135 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012724170225.53
136 rdf:type schema:Person
137 sg:person.013021434071.43 schema:affiliation grid-institutes:grid.5801.c
138 schema:familyName Enderlein
139 schema:givenName Robert R.
140 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013021434071.43
141 rdf:type schema:Person
142 sg:person.01316567627.91 schema:affiliation grid-institutes:grid.5801.c
143 schema:familyName Maurer
144 schema:givenName Ueli
145 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91
146 rdf:type schema:Person
147 grid-institutes:grid.410387.9 schema:alternateName IBM Research - Zurich, Rueschlikon, Switzerland
148 schema:name IBM Research - Zurich, Rueschlikon, Switzerland
149 rdf:type schema:Organization
150 grid-institutes:grid.5801.c schema:alternateName Department of Computer Science, ETH Zürich, Zurich, Switzerland
151 schema:name Department of Computer Science, ETH Zürich, Zurich, Switzerland
152 IBM Research - Zurich, Rueschlikon, Switzerland
153 rdf:type schema:Organization
 




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


...