RSA-based undeniable signatures View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1997

AUTHORS

Rosario Gennaro , Hugo Krawczyk , Tal Rabin

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 of all, 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 signatures are identical in form to standard RSA signatures, the scheme we present becomes a very attractive candidate for practical implementations. More... »

PAGES

132-149

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York, 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": "Technion, IBM T.J. Watson Research Center and Department of Electrical Engineering, 32000, Haifa, Israel", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Technion, IBM T.J. Watson Research Center and Department of Electrical Engineering, 32000, Haifa, Israel"
          ], 
          "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 Center, PO Box 704, 10598, Yorktown Heights, New York, USA", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York, 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": "1997", 
    "datePublishedReg": "1997-01-01", 
    "description": "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 of all, 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 signatures are identical in form to standard RSA signatures, the scheme we present becomes a very attractive candidate for practical implementations.", 
    "editor": [
      {
        "familyName": "Kaliski", 
        "givenName": "Burton S.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0052232", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-63384-6", 
        "978-3-540-69528-8"
      ], 
      "name": "Advances in Cryptology \u2014 CRYPTO '97", 
      "type": "Book"
    }, 
    "keywords": [
      "RSA signatures", 
      "undeniable signatures", 
      "standard RSA signature", 
      "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", 
      "setting", 
      "ability", 
      "possibility", 
      "introduction", 
      "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": "132-149", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1046354398"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0052232"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0052232", 
      "https://app.dimensions.ai/details/publication/pub.1046354398"
    ], 
    "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_343.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0052232"
  }
]
 

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/bfb0052232'

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/bfb0052232'

Turtle is a human-readable linked data format.

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

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

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


 

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

131 TRIPLES      23 PREDICATES      80 URIs      73 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bfb0052232 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N984c7aafbf6240798944096dce33fecd
4 schema:datePublished 1997
5 schema:datePublishedReg 1997-01-01
6 schema:description 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 of all, 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 signatures are identical in form to standard RSA signatures, the scheme we present becomes a very attractive candidate for practical implementations.
7 schema:editor N55394d7aac3a488e9dfc12da94b5559c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Ne72240c797134ee5869552027173ad4c
12 schema:keywords RSA
13 RSA signatures
14 ability
15 above properties
16 addition
17 advanced properties
18 amount
19 attractive candidate
20 attractive properties
21 candidates
22 composite modulus
23 confirmation
24 contrast
25 convertibility
26 elegant solution
27 existence
28 exponent
29 fact
30 form
31 implementation
32 introduction
33 investigation
34 literature
35 log system
36 messages
37 modulus
38 new setting
39 operation
40 parties
41 possibility
42 power
43 practical implementation
44 properties
45 protocol
46 provable security
47 public messages
48 scheme
49 security
50 setting
51 signature scheme
52 signatures
53 signers
54 significant amount
55 signing
56 solution
57 standard RSA signature
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 132-149
68 schema:productId N679c043d97b2417c92fb048fcec74985
69 Ndcc06381eacf44faa9fcab545ad2f63d
70 schema:publisher N4a7bde1f0c034130b35e221deec94e1a
71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046354398
72 https://doi.org/10.1007/bfb0052232
73 schema:sdDatePublished 2022-05-20T07:46
74 schema:sdLicense https://scigraph.springernature.com/explorer/license/
75 schema:sdPublisher Naf2be5fa5c4942b6b45db2c0c93e0920
76 schema:url https://doi.org/10.1007/bfb0052232
77 sgo:license sg:explorer/license/
78 sgo:sdDataset chapters
79 rdf:type schema:Chapter
80 N4a7bde1f0c034130b35e221deec94e1a schema:name Springer Nature
81 rdf:type schema:Organisation
82 N55394d7aac3a488e9dfc12da94b5559c rdf:first Nc3e596e5041c46a797af900221e51028
83 rdf:rest rdf:nil
84 N679c043d97b2417c92fb048fcec74985 schema:name doi
85 schema:value 10.1007/bfb0052232
86 rdf:type schema:PropertyValue
87 N770a54286c03418a8f1f5f2f272a4be1 rdf:first sg:person.015473523512.58
88 rdf:rest rdf:nil
89 N984c7aafbf6240798944096dce33fecd rdf:first sg:person.013573255563.35
90 rdf:rest Nacdc303dff684b39a79c10b1a34335f3
91 Nacdc303dff684b39a79c10b1a34335f3 rdf:first sg:person.013004021661.30
92 rdf:rest N770a54286c03418a8f1f5f2f272a4be1
93 Naf2be5fa5c4942b6b45db2c0c93e0920 schema:name Springer Nature - SN SciGraph project
94 rdf:type schema:Organization
95 Nc3e596e5041c46a797af900221e51028 schema:familyName Kaliski
96 schema:givenName Burton S.
97 rdf:type schema:Person
98 Ndcc06381eacf44faa9fcab545ad2f63d schema:name dimensions_id
99 schema:value pub.1046354398
100 rdf:type schema:PropertyValue
101 Ne72240c797134ee5869552027173ad4c schema:isbn 978-3-540-63384-6
102 978-3-540-69528-8
103 schema:name Advances in Cryptology — CRYPTO '97
104 rdf:type schema:Book
105 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
106 schema:name Information and Computing Sciences
107 rdf:type schema:DefinedTerm
108 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
109 schema:name Data Format
110 rdf:type schema:DefinedTerm
111 sg:person.013004021661.30 schema:affiliation grid-institutes:grid.6451.6
112 schema:familyName Krawczyk
113 schema:givenName Hugo
114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013004021661.30
115 rdf:type schema:Person
116 sg:person.013573255563.35 schema:affiliation grid-institutes:grid.481554.9
117 schema:familyName Gennaro
118 schema:givenName Rosario
119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013573255563.35
120 rdf:type schema:Person
121 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
122 schema:familyName Rabin
123 schema:givenName Tal
124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
125 rdf:type schema:Person
126 grid-institutes:grid.481554.9 schema:alternateName IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York, USA
127 schema:name IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York, USA
128 rdf:type schema:Organization
129 grid-institutes:grid.6451.6 schema:alternateName Technion, IBM T.J. Watson Research Center and Department of Electrical Engineering, 32000, Haifa, Israel
130 schema:name Technion, IBM T.J. Watson Research Center and Department of Electrical Engineering, 32000, Haifa, Israel
131 rdf:type schema:Organization
 




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


...