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": "IBM T.J.Watson Research, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "IBM T.J.Watson Research, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gennaro", 
        "givenName": "Rosario", 
        "id": "sg:person.013573255563.35", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Stanford University, USA", 
          "id": "http://www.grid.ac/institutes/grid.168010.e", 
          "name": [
            "Stanford University, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jarecki", 
        "givenName": "Stanislaw", 
        "id": "sg:person.014344574541.81", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014344574541.81"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J.Watson Research, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "IBM T.J.Watson Research, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Krawczyk", 
        "givenName": "Hugo", 
        "id": "sg:person.013004021661.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J.Watson Research, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "IBM T.J.Watson Research, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rabin", 
        "givenName": "Tal", 
        "id": "sg:person.015473523512.58", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2003-02-28", 
    "datePublishedReg": "2003-02-28", 
    "description": "A Distributed Key Generation (DKG)p rotocol is an essential component of any threshold cryptosystem. It is used to initialize the cryptosystem and generate its private and public keys, and it is used as a subprotocol, for example to generate a one-time key pair which is a part of any threshold El-Gamal-like signature scheme. Gennaro et al. showed [GJKR99] that a widely-known non-interactive DKG protocol suggested by Pedersen does not guarantee a uniformly random distribution of generated secret keys even in the static adversary model. Furthermore, Gennaro et al. proposed to replace this protocol with one that guarantees a uniform distribution of the generated key but requires an extra round of reliable broadcast communication. We investigate the question whether some discrete-log based threshold cryptosystems remain secure when implemented using the more efficient DKG protocol of Pedersen, in spite of the fact that the adversary can skew the distribution of the secret key generated by this protocol. We answer this question in the positive. We show that threshold versions of some schemes whose security reduces to the hardness of the discrete logarithm problem, remain secure when implemented with Pedersen DKG. We exemplify this claim with a threshold Schnorr signature scheme. However, the resulting scheme has less efficient security reduction (in the random oracle model)from the hardness of the discrete logarithm problem than the same scheme implemented with the computationally more expensive DKG protocol of Gennaro et al. Thus our results imply a trade-o. in the design of threshold versions of certain discrete-log based schemes between the round complexity of a protocol and the size of the modulus.", 
    "editor": [
      {
        "familyName": "Joye", 
        "givenName": "Marc", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-36563-x_26", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-00847-7", 
        "978-3-540-36563-1"
      ], 
      "name": "Topics in Cryptology \u2014 CT-RSA 2003", 
      "type": "Book"
    }, 
    "keywords": [
      "discrete logarithm problem", 
      "Gennaro et al", 
      "DKG protocol", 
      "threshold cryptosystems", 
      "logarithm problem", 
      "secret key", 
      "signature scheme", 
      "efficient security reduction", 
      "reliable broadcast communication", 
      "Schnorr signature scheme", 
      "key generation protocol", 
      "threshold version", 
      "secure applications", 
      "adversary model", 
      "key pair", 
      "public key", 
      "key generation", 
      "broadcast communication", 
      "security reduction", 
      "random oracles", 
      "round complexity", 
      "cryptosystem", 
      "El Gamal", 
      "generation protocol", 
      "scheme", 
      "key", 
      "protocol", 
      "adversary", 
      "extra round", 
      "oracle", 
      "security", 
      "subprotocol", 
      "same scheme", 
      "complexity", 
      "version", 
      "communication", 
      "applications", 
      "positives", 
      "essential component", 
      "design", 
      "et al", 
      "example", 
      "DKG", 
      "model", 
      "generation", 
      "rounds", 
      "one", 
      "components", 
      "questions", 
      "part", 
      "results", 
      "fact", 
      "uniform distribution", 
      "pairs", 
      "distribution", 
      "Pedersen", 
      "trade", 
      "random distribution", 
      "size", 
      "spite", 
      "al", 
      "claims", 
      "reduction", 
      "hardness", 
      "problem", 
      "modulus"
    ], 
    "name": "Secure Applications of Pedersen\u2019s Distributed Key Generation Protocol", 
    "pagination": "373-390", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1038350402"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-36563-x_26"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-36563-x_26", 
      "https://app.dimensions.ai/details/publication/pub.1038350402"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:56", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_73.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-36563-x_26"
  }
]

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.

150 TRIPLES      23 PREDICATES      91 URIs      84 LITERALS      7 BLANK NODES