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/09", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Engineering", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0905", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Civil Engineering", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "MIT, Cambridge, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "MIT, Cambridge, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bitansky", 
        "givenName": "Nir", 
        "id": "sg:person.016302552357.74", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016302552357.74"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Boston University, Boston, USA", 
          "id": "http://www.grid.ac/institutes/grid.189504.1", 
          "name": [
            "Boston University, Boston, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Paneth", 
        "givenName": "Omer", 
        "id": "sg:person.014073524511.68", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014073524511.68"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Northeastern University, Boston, USA", 
          "id": "http://www.grid.ac/institutes/grid.261112.7", 
          "name": [
            "Northeastern University, Boston, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wichs", 
        "givenName": "Daniel", 
        "id": "sg:person.016071322513.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016071322513.42"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2015-12-19", 
    "datePublishedReg": "2015-12-19", 
    "description": "We construct trapdoor permutations based on (sub-exponential) indistinguishability obfuscation and one-way functions, thereby providing the first candidate that is not based on the hardness of factoring.Our construction shows that even highly structured primitives, such as trapdoor permutations, can be potentially based on hardness assumptions with noisy structures such as those used in candidate constructions of indistinguishability obfuscation. It also suggest a possible way to construct trapdoor permutations that resist quantum attacks, and that their hardness may be based on problems outside the complexity class \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$\\text{ SZK } $$\n\\end{document}\u00a0\u2014 indeed, while factoring-based candidates do not possess such security, future constructions of indistinguishability obfuscation might.As a corollary, we eliminate the need to assume trapdoor permutations and injective one-way function in many recent constructions based on indistinguishability obfuscation.", 
    "editor": [
      {
        "familyName": "Kushilevitz", 
        "givenName": "Eyal", 
        "type": "Person"
      }, 
      {
        "familyName": "Malkin", 
        "givenName": "Tal", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-49096-9_20", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-49095-2", 
        "978-3-662-49096-9"
      ], 
      "name": "Theory of Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "function", 
      "first candidate", 
      "candidates", 
      "need", 
      "attacks", 
      "trapdoor permutations", 
      "indistinguishability obfuscation", 
      "one-way functions", 
      "possible ways", 
      "class", 
      "obfuscation", 
      "hardness of factoring", 
      "factoring", 
      "structured primitives", 
      "hardness assumption", 
      "noisy structures", 
      "structure", 
      "candidate construction", 
      "way", 
      "quantum attacks", 
      "problem", 
      "complexity classes", 
      "such security", 
      "permutations", 
      "construction", 
      "primitives", 
      "assumption", 
      "SZK", 
      "security", 
      "corollary", 
      "edge of chaos", 
      "edge", 
      "hardness", 
      "future construction", 
      "recent construction", 
      "chaos", 
      "perfect structure"
    ], 
    "name": "Perfect Structure on the Edge of Chaos", 
    "pagination": "474-502", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1001843931"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-49096-9_20"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-49096-9_20", 
      "https://app.dimensions.ai/details/publication/pub.1001843931"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:27", 
    "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_134.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-49096-9_20"
  }
]

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.

122 TRIPLES      23 PREDICATES      62 URIs      55 LITERALS      7 BLANK NODES