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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, 8092, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, 8092, Zurich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jost", 
        "givenName": "Daniel", 
        "id": "sg:person.013356446515.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013356446515.02"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, ETH Zurich, 8092, Zurich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "Department of Computer Science, ETH Zurich, 8092, 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": "2018-08-03", 
    "datePublishedReg": "2018-08-03", 
    "description": "Hash functions are one of the most important cryptographic primitives, but their desired security properties have proven to be remarkably hard to formalize. To prove the security of a protocol using a hash function, nowadays often the random oracle model (ROM) is used due to its simplicity and its strong security guarantees. Moreover, hash function constructions are commonly proven to be secure by showing them to be indifferentiable from a random oracle when using an ideal compression function. However, it is well known that no hash function realizes a random oracle and no real compression function realizes an ideal one.As an alternative to the ROM, Bellare et al. recently proposed the notion of universal computational extractors (UCE). This notion formalizes that a family of functions \u201cbehaves like a random oracle\u201d for \u201creal-world\u201d protocols while avoiding the general impossibility results. However, in contrast to the indifferentiability framework, UCE is formalized as a multi-stage game without clear composition guarantees.As a first contribution, we introduce context-restricted indifferentiability (CRI), a generalization of indifferentiability that allows us to model that the random oracle does not compose generally but can only be used within a well-specified set of protocols run by the honest parties, thereby making the provided composition guarantees explicit. We then show that UCE and its variants can be phrased as a special case of CRI. Moreover, we show how our notion of CRI leads to generalizations of UCE. As a second contribution, we prove that the hash function constructed by Merkle-Damg\u00e5d satisfies one of the well-known UCE variants, if we assume that the compression function satisfies one of our generalizations of UCE, basing the overall security on a plausible assumption. This result further validates the Merkle-Damg\u00e5rd construction and shows that UCE-like assumptions can serve both as a valid reference point for modular protocol analyses, as well as for the design of hash functions, linking those two aspects in a framework with explicit composition guarantees.", 
    "editor": [
      {
        "familyName": "Catalano", 
        "givenName": "Dario", 
        "type": "Person"
      }, 
      {
        "familyName": "De Prisco", 
        "givenName": "Roberto", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-98113-0_5", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-98112-3", 
        "978-3-319-98113-0"
      ], 
      "name": "Security and Cryptography for Networks", 
      "type": "Book"
    }, 
    "keywords": [
      "universal computational extractors", 
      "random oracle model", 
      "hash function", 
      "random oracles", 
      "strong security guarantees", 
      "important cryptographic primitive", 
      "compression function", 
      "ideal compression function", 
      "Bellare et al", 
      "set of protocols", 
      "hash function construction", 
      "security properties", 
      "cryptographic primitives", 
      "overall security", 
      "security guarantees", 
      "security definitions", 
      "oracle model", 
      "indifferentiability framework", 
      "Merkle-Damg\u00e5rd construction", 
      "honest parties", 
      "general impossibility", 
      "oracle", 
      "second contribution", 
      "guarantees", 
      "multi-stage game", 
      "first contribution", 
      "security", 
      "valid reference point", 
      "function construction", 
      "indifferentiability", 
      "framework", 
      "protocol", 
      "primitives", 
      "extractor", 
      "protocol analysis", 
      "satisfies one", 
      "reference point", 
      "family of functions", 
      "game", 
      "generalization", 
      "special case", 
      "set", 
      "notion", 
      "ideal one", 
      "one", 
      "construction", 
      "simplicity", 
      "design", 
      "parties", 
      "assumption", 
      "definition", 
      "model", 
      "variants", 
      "aspects", 
      "function", 
      "contribution", 
      "point", 
      "et al", 
      "results", 
      "alternative", 
      "impossibility", 
      "analysis", 
      "cases", 
      "plausible assumptions", 
      "properties", 
      "al", 
      "contrast", 
      "family"
    ], 
    "name": "Security Definitions for Hash Functions: Combining UCE and Indifferentiability", 
    "pagination": "83-101", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1105982673"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-98113-0_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-98113-0_5", 
      "https://app.dimensions.ai/details/publication/pub.1105982673"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:42", 
    "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_180.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-98113-0_5"
  }
]

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.

140 TRIPLES      23 PREDICATES      93 URIs      86 LITERALS      7 BLANK NODES