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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "MIT, Cambridge, USA", 
          "id": "http://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "MIT, Cambridge, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "LaVigne", 
        "givenName": "Rio", 
        "id": "sg:person.013513047001.56", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013513047001.56"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Zurich, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Liu-Zhang", 
        "givenName": "Chen-Da", 
        "id": "sg:person.011544110647.05", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011544110647.05"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Zurich, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maurer", 
        "givenName": "Ueli", 
        "id": "sg:person.01316567627.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IDC Herzliya, Herzliya, Israel", 
          "id": "http://www.grid.ac/institutes/grid.21166.32", 
          "name": [
            "IDC Herzliya, Herzliya, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Moran", 
        "givenName": "Tal", 
        "id": "sg:person.012022173111.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012022173111.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Zurich, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mularczyk", 
        "givenName": "Marta", 
        "id": "sg:person.013734432247.31", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013734432247.31"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Aarhus University, Aarhus, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.7048.b", 
          "name": [
            "Aarhus University, Aarhus, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tschudi", 
        "givenName": "Daniel", 
        "id": "sg:person.011112577475.84", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011112577475.84"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2018-11-08", 
    "datePublishedReg": "2018-11-08", 
    "description": "Topology-hiding communication protocols allow a set of parties, connected by an incomplete network with unknown communication graph, where each party only knows its neighbors, to construct a complete communication network such that the network topology remains hidden even from a powerful adversary who can corrupt parties. This communication network can then be used to perform arbitrary tasks, for example secure multi-party computation, in a topology-hiding manner. Previously proposed protocols could only tolerate passive corruption. This paper proposes protocols that can also tolerate fail-corruption (i.e., the adversary can crash any party at any point in time) and so-called semi-malicious corruption (i.e., the adversary can control a corrupted party\u2019s randomness), without leaking more than an arbitrarily small fraction of a bit of information about the topology. A small-leakage protocol was recently proposed by Ball et al. [Eurocrypt\u201918], but only under the unrealistic set-up assumption that each party has a trusted hardware module containing secret correlated pre-set keys, and with the further two restrictions that only passively corrupted parties can be crashed by the adversary, and semi-malicious corruption is not tolerated. Since leaking a small amount of information is unavoidable, as is the need to abort the protocol in case of failures, our protocols seem to achieve the best possible goal in a model with fail-corruption.Further contributions of the paper are applications of the protocol to obtain secure MPC protocols, which requires a way to bound the aggregated leakage when multiple small-leakage protocols are executed in parallel or sequentially. Moreover, while previous protocols are based on the DDH assumption, a new so-called PKCR public-key encryption scheme based on the LWE assumption is proposed, allowing to base topology-hiding computation on LWE. Furthermore, a protocol using fully-homomorphic encryption achieving very low round complexity is proposed.", 
    "editor": [
      {
        "familyName": "Beimel", 
        "givenName": "Amos", 
        "type": "Person"
      }, 
      {
        "familyName": "Dziembowski", 
        "givenName": "Stefan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-030-03810-6_1", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-030-03809-0", 
        "978-3-030-03810-6"
      ], 
      "name": "Theory of Cryptography", 
      "type": "Book"
    }, 
    "keywords": [
      "Topology-Hiding Computation", 
      "communication networks", 
      "secure multi-party computation", 
      "public-key encryption scheme", 
      "lower round complexity", 
      "multi-party computation", 
      "secure MPC protocol", 
      "semi-honest adversaries", 
      "set of parties", 
      "complete communication network", 
      "homomorphic encryption", 
      "encryption scheme", 
      "hardware modules", 
      "MPC protocols", 
      "communication protocols", 
      "arbitrary tasks", 
      "powerful adversary", 
      "communication graph", 
      "DDH assumption", 
      "round complexity", 
      "network topology", 
      "LWE assumption", 
      "corrupt parties", 
      "incomplete networks", 
      "adversary", 
      "bits of information", 
      "previous protocols", 
      "network", 
      "passive corruptions", 
      "case of failure", 
      "computation", 
      "protocol", 
      "encryption", 
      "possible goals", 
      "topology", 
      "information", 
      "set", 
      "LWE", 
      "graph", 
      "further contribution", 
      "task", 
      "neighbors", 
      "parties", 
      "complexity", 
      "bits", 
      "module", 
      "scheme", 
      "key", 
      "applications", 
      "corruption", 
      "unrealistic set", 
      "goal", 
      "assumption", 
      "way", 
      "need", 
      "parallel", 
      "model", 
      "small fraction", 
      "manner", 
      "et al", 
      "Ball et al", 
      "amount", 
      "restriction", 
      "contribution", 
      "leakage", 
      "small amount", 
      "cases", 
      "failure", 
      "al", 
      "fraction", 
      "paper"
    ], 
    "name": "Topology-Hiding Computation Beyond Semi-Honest Adversaries", 
    "pagination": "3-35", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1109772560"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-030-03810-6_1"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-030-03810-6_1", 
      "https://app.dimensions.ai/details/publication/pub.1109772560"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:44", 
    "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_26.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-030-03810-6_1"
  }
]

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.

180 TRIPLES      23 PREDICATES      96 URIs      89 LITERALS      7 BLANK NODES