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": "MIT, Cambridge, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "MIT, Cambridge, 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": "Weizmann Institute of Science, Rehovot, Israel", 
          "id": "http://www.grid.ac/institutes/grid.13992.30", 
          "name": [
            "Weizmann Institute of Science, Rehovot, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rothblum", 
        "givenName": "Guy N.", 
        "id": "sg:person.014351474277.34", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014351474277.34"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2017-11-05", 
    "datePublishedReg": "2017-11-05", 
    "description": "We define and study zero-testable homomorphic encryption (ZTHE) \u2013 a semantically secure, somewhat homomorphic encryption scheme equipped with a weak zero test that can identify trivial zeros. These are ciphertexts that result from homomorphically evaluating an arithmetic circuit computing the zero polynomial over the integers. This is a relaxation of the (strong) zero test provided by the notion of graded encodings, which identifies all encodings of zero.We show that ZTHE can suffice for powerful applications. Based on any ZTHE scheme that satisfies the additional properties of correctness on adversarial ciphertexts and multi-key homomorphism, we construct publicly verifiable non-interactive arguments for delegating computation. Such arguments were previously constructed from indistinguishability obfuscation or based on so-called knowledge assumptions. The arguments we construct are adaptively sound, based on an efficiently falsifiable assumption, and only make black-box use of the underlying cryptographic primitives.We also show that a ZTHE scheme that is sufficient for our application can be constructed based on an efficiently-falsifiable assumption over so-called \u201cclean\u201d graded encodings.", 
    "editor": [
      {
        "familyName": "Kalai", 
        "givenName": "Yael", 
        "type": "Person"
      }, 
      {
        "familyName": "Reyzin", 
        "givenName": "Leonid", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-70503-3_9", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-70502-6", 
        "978-3-319-70503-3"
      ], 
      "name": "Theory of Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "non-interactive arguments", 
      "homomorphic encryption", 
      "homomorphic encryption scheme", 
      "black-box use", 
      "falsifiable assumptions", 
      "encryption scheme", 
      "cryptographic primitives", 
      "indistinguishability obfuscation", 
      "knowledge assumptions", 
      "encryption", 
      "ciphertext", 
      "powerful applications", 
      "arithmetic circuits", 
      "encoding", 
      "scheme", 
      "primitives", 
      "obfuscation", 
      "correctness", 
      "applications", 
      "computation", 
      "additional properties", 
      "assumption", 
      "integers", 
      "notion", 
      "homomorphism", 
      "use", 
      "polynomials", 
      "circuit", 
      "trivial zeros", 
      "argument", 
      "zeros", 
      "such arguments", 
      "test", 
      "properties", 
      "relaxation"
    ], 
    "name": "On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments", 
    "pagination": "283-315", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1092520045"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-70503-3_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-70503-3_9", 
      "https://app.dimensions.ai/details/publication/pub.1092520045"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:35", 
    "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_439.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-70503-3_9"
  }
]

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      60 URIs      53 LITERALS      7 BLANK NODES