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": "Department of Computer Science, University of Illinois at Chicago, 60607, IL", 
          "id": "http://www.grid.ac/institutes/grid.185648.6", 
          "name": [
            "Department of Computer Science, University of Illinois at Chicago, 60607, IL"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Comi", 
        "givenName": "Marco", 
        "id": "sg:person.016704041233.25", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016704041233.25"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Illinois at Chicago, 60607, IL", 
          "id": "http://www.grid.ac/institutes/grid.185648.6", 
          "name": [
            "Department of Computer Science, University of Illinois at Chicago, 60607, IL"
          ], 
          "type": "Organization"
        }, 
        "familyName": "DasGupta", 
        "givenName": "Bhaskar", 
        "id": "sg:person.0763403270.10", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0763403270.10"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Princeton University, 08540, Princeton, NJ", 
          "id": "http://www.grid.ac/institutes/grid.16750.35", 
          "name": [
            "Department of Computer Science, Princeton University, 08540, Princeton, NJ"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Schapira", 
        "givenName": "Michael", 
        "id": "sg:person.015466710447.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015466710447.45"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Illinois at Chicago, 60607, IL", 
          "id": "http://www.grid.ac/institutes/grid.185648.6", 
          "name": [
            "Department of Computer Science, University of Illinois at Chicago, 60607, IL"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Srinivasan", 
        "givenName": "Venkatakumar", 
        "id": "sg:person.013172533133.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013172533133.32"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2011", 
    "datePublishedReg": "2011-01-01", 
    "description": "A traditionally desired goal when designing auction mechanisms is incentive compatibility, i.e., ensuring that bidders fare best by truthfully reporting their preferences. A complementary goal, which has, thus far, received significantly less attention, is to preserve privacy, i.e., to ensure that bidders reveal no more information than necessary. We further investigate and generalize the approximate privacy model for two-party communication recently introduced by Feigenbaum et al.\u00a0[8]. We explore the privacy properties of a natural class of communication protocols that we refer to as \u201cdissection protocols\u201d. Dissection protocols include, among others, the bisection auction in\u00a0[9,10] and the bisection protocol for the millionaires problem in\u00a0[8]. Informally, in a dissection protocol the communicating parties are restricted to answering simple questions of the form \u201cIs your input between the values \u03b1 and \u03b2 (under a pre-defined order over the possible inputs)?\u201d.We prove that for a large class of functions called tiling functions, which include the 2nd-price Vickrey auction, there always exists a dissection protocol that provides a constant average-case privacy approximation ratio for uniform or \u201calmost uniform\u201d probability distributions over inputs. To establish this result we present an interesting connection between the approximate privacy framework and basic concepts in computational geometry. We show that such a good privacy approximation ratio for tiling functions does not, in general, exist in the worst case. We also discuss extensions of the basic setup to more than two parties and to non-tiling functions, and provide calculations of privacy approximation ratios for two functions of interest.", 
    "editor": [
      {
        "familyName": "Persiano", 
        "givenName": "Giuseppe", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-24829-0_6", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-24828-3", 
        "978-3-642-24829-0"
      ], 
      "name": "Algorithmic Game Theory", 
      "type": "Book"
    }, 
    "keywords": [
      "approximation ratio", 
      "computational geometry", 
      "Feigenbaum et al", 
      "function of interest", 
      "probability distribution", 
      "large class", 
      "interesting connection", 
      "natural class", 
      "value \u03b1", 
      "basic concepts", 
      "basic setup", 
      "worst case", 
      "Vickrey auction", 
      "class", 
      "millionaire problem", 
      "et al", 
      "auction mechanism", 
      "function", 
      "geometry", 
      "communication protocols", 
      "input", 
      "calculations", 
      "problem", 
      "auctions", 
      "extension", 
      "incentive compatibility", 
      "model", 
      "simple question", 
      "uniform", 
      "distribution", 
      "properties", 
      "more information", 
      "framework", 
      "bidders", 
      "setup", 
      "connection", 
      "complementary goals", 
      "privacy model", 
      "al", 
      "form", 
      "ratio", 
      "two-party communication", 
      "privacy framework", 
      "concept", 
      "cases", 
      "communication", 
      "goal", 
      "results", 
      "interest", 
      "privacy properties", 
      "information", 
      "protocol", 
      "less attention", 
      "compatibility", 
      "questions", 
      "attention", 
      "mechanism", 
      "privacy", 
      "preferences", 
      "parties", 
      "dissection", 
      "dissection protocol"
    ], 
    "name": "On Communication Protocols That Compute Almost Privately", 
    "pagination": "44-56", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1038836899"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-24829-0_6"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-24829-0_6", 
      "https://app.dimensions.ai/details/publication/pub.1038836899"
    ], 
    "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_171.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-24829-0_6"
  }
]

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.

146 TRIPLES      23 PREDICATES      88 URIs      81 LITERALS      7 BLANK NODES