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"
      }, 
      {
        "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": "ETH Zurich, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hirt", 
        "givenName": "Martin", 
        "id": "sg:person.010611500757.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010611500757.30"
        ], 
        "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": "ETH Zurich, Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Zurich, Z\u00fcrich, Switzerland"
          ], 
          "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"
      }, 
      {
        "affiliation": {
          "alternateName": "RPI, Troy, USA", 
          "id": "http://www.grid.ac/institutes/grid.33647.35", 
          "name": [
            "RPI, Troy, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zikas", 
        "givenName": "Vassilis", 
        "id": "sg:person.012007513121.08", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012007513121.08"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2016-07-21", 
    "datePublishedReg": "2016-07-21", 
    "description": "As distributed networks are heavily used in modern applications, new security challenges emerge. In a multi-party computation (in short, MPC) protocol over an incomplete network, such a challenge is to hide, to the extent possible, the topology of the underlying communication network. Such a topology-hiding (aka network hiding) property is in fact very relevant in applications where anonymity is needed.To our knowledge, with the exception of two recent works by Chandran et al. [ITCS\u00a02015] and by Moran et al. [TCC\u00a02015], existing MPC protocols do not hide the topology of the underlying communication network. Moreover, the above two solutions are either not applicable to arbitrary networks (as is [ITCS\u00a02015]) or, as in [TCC\u00a02015], they make non-black-box and recursive use of cryptographic primitives resulting in an unrealistic communication and computation complexity even for simple, i.e., low degree and diameter, networks.Our work suggests the first topology-hiding communication protocol for incomplete networks which makes black-box use of the underlying cryptographic assumption\u2014in particular, a public-key encryption scheme\u2014and tolerates any adversary who passively corrupts arbitrarily many network nodes. Our solutions are based on a new, enhanced variant of threshold homomorphic encryption, in short, TH-PKE, that requires no a-priori setup and allows to circulate an encrypted message over any (unknown) incomplete network and then decrypt it without revealing any network information to intermediate nodes. We show how to realize this enhanced TH-PKE from the DDH assumption. The black-box nature of our scheme, along with some optimization tricks that we employ, makes our communication protocol more efficient than existing solutions.We then use our communication protocol to make any semi-honest secure MPC protocol topology-hiding with a reasonable\u2014i.e., for simple networks, polynomial with small constants\u2014communication and computation overhead. We further show how to construct anonymous broadcast without using expensive MPCs to setup the original pseudonyms.", 
    "editor": [
      {
        "familyName": "Robshaw", 
        "givenName": "Matthew", 
        "type": "Person"
      }, 
      {
        "familyName": "Katz", 
        "givenName": "Jonathan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-53008-5_12", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-53007-8", 
        "978-3-662-53008-5"
      ], 
      "name": "Advances in Cryptology \u2013 CRYPTO 2016", 
      "type": "Book"
    }, 
    "keywords": [
      "incomplete networks", 
      "MPC protocols", 
      "communication protocols", 
      "communication networks", 
      "public-key encryption scheme", 
      "threshold homomorphic encryption", 
      "multi-party computation", 
      "new security challenges", 
      "black-box use", 
      "secure MPC protocol", 
      "multi-party protocols", 
      "black-box nature", 
      "homomorphic encryption", 
      "encryption scheme", 
      "cryptographic primitives", 
      "network information", 
      "cryptographic assumptions", 
      "security challenges", 
      "computation complexity", 
      "intermediate nodes", 
      "network nodes", 
      "anonymous broadcast", 
      "DDH assumption", 
      "optimization tricks", 
      "modern applications", 
      "arbitrary networks", 
      "enhanced variant", 
      "network", 
      "simple network", 
      "recursive use", 
      "communication", 
      "computation", 
      "nodes", 
      "protocol", 
      "encryption", 
      "scheme", 
      "adversary", 
      "topology", 
      "primitives", 
      "applications", 
      "anonymity", 
      "pseudonyms", 
      "broadcast", 
      "challenges", 
      "messages", 
      "complexity", 
      "recent work", 
      "solution", 
      "Chandran", 
      "MPC", 
      "assumption", 
      "information", 
      "et al", 
      "work", 
      "tricks", 
      "setup", 
      "box", 
      "use", 
      "knowledge", 
      "al", 
      "properties", 
      "variants", 
      "fact", 
      "Moran et al", 
      "nature", 
      "degree", 
      "low degree", 
      "diameter", 
      "extent", 
      "exception"
    ], 
    "name": "Network-Hiding Communication and Applications to Multi-party Protocols", 
    "pagination": "335-365", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1050792972"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-53008-5_12"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-53008-5_12", 
      "https://app.dimensions.ai/details/publication/pub.1050792972"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:46", 
    "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_349.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-53008-5_12"
  }
]

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.

163 TRIPLES      23 PREDICATES      96 URIs      88 LITERALS      7 BLANK NODES