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": "Carnegie Mellon University, 15213, Pittsburgh, PA, USA", 
          "id": "http://www.grid.ac/institutes/grid.147455.6", 
          "name": [
            "Carnegie Mellon University, 15213, Pittsburgh, PA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kissner", 
        "givenName": "Lea", 
        "id": "sg:person.010203554137.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010203554137.83"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Carnegie Mellon University, 15213, Pittsburgh, PA, USA", 
          "id": "http://www.grid.ac/institutes/grid.147455.6", 
          "name": [
            "Carnegie Mellon University, 15213, Pittsburgh, PA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Song", 
        "givenName": "Dawn", 
        "id": "sg:person.01143152610.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01143152610.86"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2005", 
    "datePublishedReg": "2005-01-01", 
    "description": "In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party\u2019s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties\u2019 private input sets than what can be deduced from the result. In this paper, we propose efficient techniques for privacy-preserving operations on multisets. By building a framework of multiset operations, employing the mathematical properties of polynomials, we design efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work.", 
    "editor": [
      {
        "familyName": "Shoup", 
        "givenName": "Victor", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11535218_15", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-28114-6", 
        "978-3-540-31870-5"
      ], 
      "name": "Advances in Cryptology \u2013 CRYPTO 2005", 
      "type": "Book"
    }, 
    "keywords": [
      "privacy-preserving computation", 
      "private input sets", 
      "privacy-preserving operations", 
      "private computation", 
      "private set", 
      "composable method", 
      "multiset operations", 
      "party\u2019s input", 
      "distrustful parties", 
      "input set", 
      "efficient results", 
      "reduction operations", 
      "set operations", 
      "efficient technique", 
      "computation", 
      "input multiset", 
      "multiset", 
      "important applications", 
      "practical problems", 
      "previous work", 
      "set", 
      "more information", 
      "operation", 
      "mathematical properties", 
      "input", 
      "parties", 
      "technique", 
      "framework", 
      "information", 
      "applications", 
      "collection", 
      "wide range", 
      "players", 
      "work", 
      "intersection", 
      "order", 
      "results", 
      "method", 
      "polynomials", 
      "function", 
      "range", 
      "Union", 
      "properties", 
      "problem", 
      "paper"
    ], 
    "name": "Privacy-Preserving Set Operations", 
    "pagination": "241-257", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1039851897"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11535218_15"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11535218_15", 
      "https://app.dimensions.ai/details/publication/pub.1039851897"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:49", 
    "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_96.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11535218_15"
  }
]

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.

112 TRIPLES      23 PREDICATES      71 URIs      64 LITERALS      7 BLANK NODES