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

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

153 TRIPLES      23 PREDICATES      89 URIs      80 LITERALS      7 BLANK NODES