RSA-Based Undeniable Signatures View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2000-03-21

AUTHORS

Rosario Gennaro, Tal Rabin, Hugo Krawczyk

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. More... »

PAGES

397-416

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s001450010001

DOI

http://dx.doi.org/10.1007/s001450010001

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1007871902


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s001450010001'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s001450010001'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s001450010001'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s001450010001'


 

This table displays all metadata directly associated to this object as RDF triples.

128 TRIPLES      21 PREDICATES      78 URIs      70 LITERALS      6 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s001450010001 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N0d74f2bc61fa45c5bc3676c194a46a89
4 schema:datePublished 2000-03-21
5 schema:datePublishedReg 2000-03-21
6 schema: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.
7 schema:genre article
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isPartOf N568ee37fe2c94a5ca96ae3b1ce753c02
11 Ndd1d8c88620f4cffa9773ea9d05fc31e
12 sg:journal.1136278
13 schema:keywords RSA
14 RSA signatures
15 ability
16 above properties
17 addition
18 advanced properties
19 amount
20 attractive candidate
21 attractive properties
22 candidates
23 composite modulus
24 confirmation
25 contrast
26 convertibility
27 elegant solution
28 existence
29 exponent
30 fact
31 form
32 implementation
33 introduction
34 investigation
35 literature
36 log system
37 messages
38 modulus
39 new setting
40 operation
41 parties
42 possibility
43 power
44 practical implementation
45 properties
46 protocol
47 provable security
48 public messages
49 scheme
50 security
51 setting
52 signature scheme
53 signatures
54 signers
55 significant amount
56 signing
57 solution
58 structure
59 system
60 third party
61 undeniable signature scheme
62 undeniable signatures
63 version
64 work
65 zero-knowledge
66 schema:name RSA-Based Undeniable Signatures
67 schema:pagination 397-416
68 schema:productId Nc1209a43bf95424e97c1c653ccce6880
69 Nf17ae35bec1b4409826b0f3c4c4fcce9
70 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007871902
71 https://doi.org/10.1007/s001450010001
72 schema:sdDatePublished 2022-05-20T07:20
73 schema:sdLicense https://scigraph.springernature.com/explorer/license/
74 schema:sdPublisher Nda7272aa3bd04f798c245e92147b2cf5
75 schema:url https://doi.org/10.1007/s001450010001
76 sgo:license sg:explorer/license/
77 sgo:sdDataset articles
78 rdf:type schema:ScholarlyArticle
79 N0d74f2bc61fa45c5bc3676c194a46a89 rdf:first sg:person.013573255563.35
80 rdf:rest N6ccdd7ba753f414e9e8664962f8e8323
81 N568ee37fe2c94a5ca96ae3b1ce753c02 schema:issueNumber 4
82 rdf:type schema:PublicationIssue
83 N6ccdd7ba753f414e9e8664962f8e8323 rdf:first sg:person.015473523512.58
84 rdf:rest Nbfaa651f61134e6ea7f591f03f83d815
85 Nbfaa651f61134e6ea7f591f03f83d815 rdf:first sg:person.013004021661.30
86 rdf:rest rdf:nil
87 Nc1209a43bf95424e97c1c653ccce6880 schema:name doi
88 schema:value 10.1007/s001450010001
89 rdf:type schema:PropertyValue
90 Nda7272aa3bd04f798c245e92147b2cf5 schema:name Springer Nature - SN SciGraph project
91 rdf:type schema:Organization
92 Ndd1d8c88620f4cffa9773ea9d05fc31e schema:volumeNumber 13
93 rdf:type schema:PublicationVolume
94 Nf17ae35bec1b4409826b0f3c4c4fcce9 schema:name dimensions_id
95 schema:value pub.1007871902
96 rdf:type schema:PropertyValue
97 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
98 schema:name Information and Computing Sciences
99 rdf:type schema:DefinedTerm
100 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
101 schema:name Computation Theory and Mathematics
102 rdf:type schema:DefinedTerm
103 sg:journal.1136278 schema:issn 0933-2790
104 1432-1378
105 schema:name Journal of Cryptology
106 schema:publisher Springer Nature
107 rdf:type schema:Periodical
108 sg:person.013004021661.30 schema:affiliation grid-institutes:grid.6451.6
109 schema:familyName Krawczyk
110 schema:givenName Hugo
111 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30
112 rdf:type schema:Person
113 sg:person.013573255563.35 schema:affiliation grid-institutes:grid.481554.9
114 schema:familyName Gennaro
115 schema:givenName Rosario
116 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35
117 rdf:type schema:Person
118 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
119 schema:familyName Rabin
120 schema:givenName Tal
121 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
122 rdf:type schema:Person
123 grid-institutes:grid.481554.9 schema: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
124 schema: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
125 rdf:type schema:Organization
126 grid-institutes:grid.6451.6 schema: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
127 schema: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
128 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...