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": "IBM T.J.  Watson Research Center,   PO Box 704, Yorktown Heights, NY  10598, U.S.A. rosario@watson.ibm.com, talr@watson.ibm.com, US", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J.  Watson Research Center,   PO Box 704, Yorktown Heights, NY  10598, U.S.A. rosario@watson.ibm.com, talr@watson.ibm.com, US"
          ], 
          "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": "IBM T.J.  Watson Research Center,   PO Box 704, Yorktown Heights, NY  10598, U.S.A. rosario@watson.ibm.com, talr@watson.ibm.com, US", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J.  Watson Research Center,   PO Box 704, Yorktown Heights, NY  10598, U.S.A. rosario@watson.ibm.com, talr@watson.ibm.com, US"
          ], 
          "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"
      }, 
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center,  PO Box 704, Yorktown Heights, NY  10598, U.S.A.    and   Department of Electrical Engineering, Technion, Haifa 32000, Israel    hugo@ee.technion.ac.il, IL", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "IBM T.J. Watson Research Center,  PO Box 704, Yorktown Heights, NY  10598, U.S.A.    and   Department of Electrical Engineering, Technion, Haifa 32000, Israel    hugo@ee.technion.ac.il, IL"
          ], 
          "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"
      }
    ], 
    "datePublished": "2000-03-21", 
    "datePublishedReg": "2000-03-21", 
    "description": "Abstract.  We present the first undeniable signatures scheme based on RSA. Since their introduction in 1989 a significant amount of work has been devoted to the investigation of undeniable signatures. So far, this work has been based on discrete log systems. In contrast, our scheme uses regular RSA signatures to generate undeniable signatures. In this new setting, both the signature and verification exponents of RSA are kept secret by the signer, while the public key consists of a composite modulus and a sample RSA signature on a single public message. Our scheme possesses several attractive properties. First, provable security, as forging the undeniable signatures is as hard as forging regular RSA signatures. Second, both the confirmation and denial protocols are zero-knowledge. In addition, these protocols are efficient (particularly, the confirmation protocol involves only two rounds of communication and a small number of exponentiations). Furthermore, the RSA-based structure of our scheme provides with simple and elegant solutions to add several of the more advanced properties of undeniable signatures found in the literature, including convertibility of the undeniable signatures (into publicly verifiable ones), the possibility to delegate the ability to confirm and deny signatures to a third party without giving up the power to sign, and the existence of distributed (threshold) versions of the signing and confirmation operations. Due to the above properties and the fact that our undeniable nsignatures are identical in form to standard  RSA signatures, the scheme we present becomes a very attractive candidate for practical implementations.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s001450010001", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136278", 
        "issn": [
          "0933-2790", 
          "1432-1378"
        ], 
        "name": "Journal of Cryptology", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "13"
      }
    ], 
    "keywords": [
      "RSA signatures", 
      "undeniable signatures", 
      "undeniable signature scheme", 
      "provable security", 
      "zero-knowledge", 
      "signature scheme", 
      "log system", 
      "RSA", 
      "third party", 
      "elegant solution", 
      "practical implementation", 
      "scheme", 
      "public messages", 
      "security", 
      "new setting", 
      "protocol", 
      "signers", 
      "messages", 
      "implementation", 
      "attractive properties", 
      "work", 
      "signatures", 
      "signing", 
      "significant amount", 
      "system", 
      "version", 
      "operation", 
      "solution", 
      "parties", 
      "above properties", 
      "power", 
      "amount", 
      "fact", 
      "ability", 
      "setting", 
      "introduction", 
      "possibility", 
      "literature", 
      "composite modulus", 
      "structure", 
      "candidates", 
      "form", 
      "addition", 
      "properties", 
      "convertibility", 
      "exponent", 
      "advanced properties", 
      "existence", 
      "attractive candidate", 
      "contrast", 
      "investigation", 
      "modulus", 
      "confirmation"
    ], 
    "name": "RSA-Based Undeniable Signatures", 
    "pagination": "397-416", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1007871902"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s001450010001"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s001450010001", 
      "https://app.dimensions.ai/details/publication/pub.1007871902"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:20", 
    "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/article/article_306.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s001450010001"
  }
]

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.

128 TRIPLES      21 PREDICATES      78 URIs      70 LITERALS      6 BLANK NODES