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": "FHNW, 5210, Windisch, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.410380.e", 
          "name": [
            "FHNW, 5210, Windisch, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Aumasson", 
        "givenName": "Jean-Philippe", 
        "id": "sg:person.012606440341.66", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012606440341.66"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Loughborough Uni, LE11 3TU, Leics, UK", 
          "id": "http://www.grid.ac/institutes/grid.6571.5", 
          "name": [
            "Loughborough Uni, LE11 3TU, Leics, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Phan", 
        "givenName": "Raphael C. -W.", 
        "id": "sg:person.014732232610.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014732232610.32"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2008-01-01", 
    "datePublishedReg": "2008-01-01", 
    "description": "In the context of iterated hash functions, \u201cdithering\u201d designates the technique of adding an iteration-dependent input to the compression function in order to defeat certain generic attacks. The purpose of this paper is to identify methods for dithering blockcipher-based hash functions that provide security bounds and efficiency, contrary to the previous proposals. We considered 56 different constructions, based on the 12 secure PGV schemes. Proofs are given in the blackbox model that 12 of them preserve the bounds on collision and inversion resistance given by Black et al. These 12 schemes avoid the need for short dither values, induce negligible extra-computation, and achieve security independent of the dither sequence used. We also identify 8 schemes that lead to strong compression functions but potentially insecure hash functions. Application of our results can be considered to popular hash functions like SHA-1 or Whirlpool.", 
    "editor": [
      {
        "familyName": "Vaudenay", 
        "givenName": "Serge", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-68164-9_21", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-68159-5", 
        "978-3-540-68164-9"
      ], 
      "name": "Progress in Cryptology \u2013 AFRICACRYPT 2008", 
      "type": "Book"
    }, 
    "keywords": [
      "hash function", 
      "popular hash functions", 
      "compression function", 
      "blockcipher-based hash functions", 
      "SHA-1", 
      "generic attacks", 
      "blackbox model", 
      "security bounds", 
      "dither sequences", 
      "previous proposals", 
      "scheme", 
      "security", 
      "blockcipher", 
      "attacks", 
      "bounds", 
      "proposal", 
      "applications", 
      "input", 
      "proof", 
      "technique", 
      "efficiency", 
      "context", 
      "need", 
      "model", 
      "order", 
      "method", 
      "construction", 
      "function", 
      "et al", 
      "different constructions", 
      "sequence", 
      "collisions", 
      "purpose", 
      "whirlpool", 
      "results", 
      "values", 
      "al", 
      "Black et al", 
      "resistance", 
      "paper"
    ], 
    "name": "How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?", 
    "pagination": "308-324", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1002349308"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-68164-9_21"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-68164-9_21", 
      "https://app.dimensions.ai/details/publication/pub.1002349308"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:31", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_264.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-68164-9_21"
  }
]

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.

110 TRIPLES      23 PREDICATES      65 URIs      58 LITERALS      7 BLANK NODES