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, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Demay", 
        "givenName": "Gr\u00e9gory", 
        "id": "sg:person.015232157523.41", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015232157523.41"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ga\u017ei", 
        "givenName": "Peter", 
        "id": "sg:person.012620015221.67", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012620015221.67"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hirt", 
        "givenName": "Martin", 
        "id": "sg:person.010611500757.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010611500757.30"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH 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": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "A major general paradigm in cryptography is the following argument: Whatever an adversary could do in the real world, it could just as well do in the ideal world. The standard interpretation of \u201cjust as well\u201d is that the translation from the real to the ideal world, usually called a simulator, is achieved by a probabilistic polynomial-time algorithm. This means that a polynomial blow-up of the adversary\u2019s time and memory requirements is considered acceptable.In certain contexts this interpretation of \u201cjust as well\u201d is inadequate, for example if the concrete amount of memory used by the adversary is relevant. The example of Ristenpart et al. (Eurocrypt 2011), for which the original indifferentiability notion introduced by Maurer et al. (Eurocrypt 2004) is shown to be insufficient, turns out to be exactly of this type. It requires a fine-grained statement about the adversary\u2019s memory capacity, calling for a generalized treatment of indifferentiability where specific resource requirements can be taken into account by modeling them explicitly.We provide such treatment and employ the new indifferentiability notion to prove lower bounds on the memory required by any simulator in a domain extension construction of a public random function. In particular, for simulators without memory, even domain extension by a single bit turns out to be impossible. Moreover, for the construction of a random oracle from an ideal compression function, memory roughly linear in the length of the longest query is required. This also implies the impossibility of such domain extension in any multi-party setting with potential individual misbehavior by parties (i.e., no central adversary).", 
    "editor": [
      {
        "familyName": "Johansson", 
        "givenName": "Thomas", 
        "type": "Person"
      }, 
      {
        "familyName": "Nguyen", 
        "givenName": "Phong Q.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-38348-9_39", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-38347-2", 
        "978-3-642-38348-9"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2013", 
      "type": "Book"
    }, 
    "keywords": [
      "probabilistic polynomial time algorithm", 
      "ideal compression function", 
      "specific resource requirements", 
      "multi-party setting", 
      "public random function", 
      "polynomial time algorithm", 
      "long queries", 
      "random oracles", 
      "memory requirements", 
      "resource requirements", 
      "real world", 
      "memory capacity", 
      "domain extension", 
      "individual misbehavior", 
      "compression function", 
      "single bit", 
      "adversary", 
      "simulator", 
      "general paradigm", 
      "ideal world", 
      "Maurer et al", 
      "indifferentiability", 
      "lower bounds", 
      "queries", 
      "cryptography", 
      "requirements", 
      "memory", 
      "oracle", 
      "algorithm", 
      "random function", 
      "certain contexts", 
      "misbehavior", 
      "bits", 
      "paradigm", 
      "extension", 
      "example", 
      "world", 
      "concrete amount", 
      "notion", 
      "construction", 
      "extension construction", 
      "bounds", 
      "et al", 
      "time", 
      "parties", 
      "context", 
      "translation", 
      "function", 
      "interpretation", 
      "amount", 
      "statements", 
      "impossibility", 
      "setting", 
      "account", 
      "types", 
      "generalized treatment", 
      "standard interpretation", 
      "capacity", 
      "al", 
      "argument", 
      "length", 
      "treatment", 
      "such treatment"
    ], 
    "name": "Resource-Restricted Indifferentiability", 
    "pagination": "664-683", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1007567403"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-38348-9_39"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-38348-9_39", 
      "https://app.dimensions.ai/details/publication/pub.1007567403"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:48", 
    "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_428.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-38348-9_39"
  }
]

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.

149 TRIPLES      23 PREDICATES      89 URIs      82 LITERALS      7 BLANK NODES