A simplified approach to threshold and proactive RSA View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1998

AUTHORS

Tal Rabin

ABSTRACT

We present a solution to both the robust threshold RSA and proactive RSA problems. Our solutions are conceptually simple, and allow for an easy design of the system. The signing key, in our solution, is shared at all times in additive form, which allows for simple signing and for a particularly efficient and straightforward refreshing process for proactivization. The key size is (up to a very small constant) the size of the RSA modulus, and the protocol runs in constant time, even when faults occur, unlike previous protocols where either the size of the key has a linear blow-up (at best) in the number of players or the run time of the protocol is linear in the number of faults. The protocol is optimal in its resilience as it can tolerate a minority of faulty players. Furthermore, unlike previous solutions, the existence and availability of the key throughout the lifetime of the system, is guaranteed without probability of error. These results are derived from a new general technique for transforming distributed computations for which there is a known n-out-n solution into threshold and robust computations. More... »

PAGES

89-104

Book

TITLE

Advances in Cryptology — CRYPTO '98

ISBN

978-3-540-64892-5
978-3-540-68462-6

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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/03", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Chemical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0306", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Physical Chemistry (incl. Structural)", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York", 
          "id": "http://www.grid.ac/institutes/grid.481554.9", 
          "name": [
            "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York"
          ], 
          "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": "1998", 
    "datePublishedReg": "1998-01-01", 
    "description": "We present a solution to both the robust threshold RSA and proactive RSA problems. Our solutions are conceptually simple, and allow for an easy design of the system. The signing key, in our solution, is shared at all times in additive form, which allows for simple signing and for a particularly efficient and straightforward refreshing process for proactivization. The key size is (up to a very small constant) the size of the RSA modulus, and the protocol runs in constant time, even when faults occur, unlike previous protocols where either the size of the key has a linear blow-up (at best) in the number of players or the run time of the protocol is linear in the number of faults. The protocol is optimal in its resilience as it can tolerate a minority of faulty players. Furthermore, unlike previous solutions, the existence and availability of the key throughout the lifetime of the system, is guaranteed without probability of error. These results are derived from a new general technique for transforming distributed computations for which there is a known n-out-n solution into threshold and robust computations.", 
    "editor": [
      {
        "familyName": "Krawczyk", 
        "givenName": "Hugo", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0055722", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-64892-5", 
        "978-3-540-68462-6"
      ], 
      "name": "Advances in Cryptology \u2014 CRYPTO '98", 
      "type": "Book"
    }, 
    "keywords": [
      "new general technique", 
      "probability of error", 
      "robust computation", 
      "additive form", 
      "number of players", 
      "Proactive RSA", 
      "number of faults", 
      "general technique", 
      "RSA problem", 
      "computation", 
      "solution", 
      "faulty players", 
      "previous solutions", 
      "constant time", 
      "refreshing process", 
      "easy design", 
      "threshold RSA", 
      "run time", 
      "simplified approach", 
      "key size", 
      "problem", 
      "probability", 
      "system", 
      "existence", 
      "error", 
      "faults", 
      "number", 
      "approach", 
      "design", 
      "RSA", 
      "technique", 
      "time", 
      "form", 
      "players", 
      "size", 
      "previous protocols", 
      "threshold", 
      "results", 
      "RSA modulus", 
      "key", 
      "process", 
      "protocol", 
      "lifetime", 
      "resilience", 
      "signing key", 
      "availability", 
      "modulus", 
      "signing", 
      "minority", 
      "robust threshold RSA", 
      "proactive RSA problems", 
      "simple signing", 
      "straightforward refreshing process", 
      "proactivization"
    ], 
    "name": "A simplified approach to threshold and proactive RSA", 
    "pagination": "89-104", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1025704946"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0055722"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0055722", 
      "https://app.dimensions.ai/details/publication/pub.1025704946"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:03", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_276.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0055722"
  }
]
 

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

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

Turtle is a human-readable linked data format.

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

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

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


 

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

114 TRIPLES      23 PREDICATES      80 URIs      73 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bfb0055722 schema:about anzsrc-for:03
2 anzsrc-for:0306
3 schema:author Ne78d707de21d4f18a2d61e384b121c6a
4 schema:datePublished 1998
5 schema:datePublishedReg 1998-01-01
6 schema:description We present a solution to both the robust threshold RSA and proactive RSA problems. Our solutions are conceptually simple, and allow for an easy design of the system. The signing key, in our solution, is shared at all times in additive form, which allows for simple signing and for a particularly efficient and straightforward refreshing process for proactivization. The key size is (up to a very small constant) the size of the RSA modulus, and the protocol runs in constant time, even when faults occur, unlike previous protocols where either the size of the key has a linear blow-up (at best) in the number of players or the run time of the protocol is linear in the number of faults. The protocol is optimal in its resilience as it can tolerate a minority of faulty players. Furthermore, unlike previous solutions, the existence and availability of the key throughout the lifetime of the system, is guaranteed without probability of error. These results are derived from a new general technique for transforming distributed computations for which there is a known n-out-n solution into threshold and robust computations.
7 schema:editor Ncfbae55e3b864eea8bf9c8eb83b4a5af
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N01a213d609854d748743df69dc7e7a51
12 schema:keywords Proactive RSA
13 RSA
14 RSA modulus
15 RSA problem
16 additive form
17 approach
18 availability
19 computation
20 constant time
21 design
22 easy design
23 error
24 existence
25 faults
26 faulty players
27 form
28 general technique
29 key
30 key size
31 lifetime
32 minority
33 modulus
34 new general technique
35 number
36 number of faults
37 number of players
38 players
39 previous protocols
40 previous solutions
41 proactive RSA problems
42 proactivization
43 probability
44 probability of error
45 problem
46 process
47 protocol
48 refreshing process
49 resilience
50 results
51 robust computation
52 robust threshold RSA
53 run time
54 signing
55 signing key
56 simple signing
57 simplified approach
58 size
59 solution
60 straightforward refreshing process
61 system
62 technique
63 threshold
64 threshold RSA
65 time
66 schema:name A simplified approach to threshold and proactive RSA
67 schema:pagination 89-104
68 schema:productId N06a00e6546724518b4a5d17c5dacd5dc
69 Nebea54d7c44346ce9815ce3bac4cb162
70 schema:publisher N5d2b349a9b4d46c8a7322a09dfd03cb3
71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025704946
72 https://doi.org/10.1007/bfb0055722
73 schema:sdDatePublished 2021-12-01T20:03
74 schema:sdLicense https://scigraph.springernature.com/explorer/license/
75 schema:sdPublisher Nc8b01c0562364e6285af16564e971967
76 schema:url https://doi.org/10.1007/bfb0055722
77 sgo:license sg:explorer/license/
78 sgo:sdDataset chapters
79 rdf:type schema:Chapter
80 N01a213d609854d748743df69dc7e7a51 schema:isbn 978-3-540-64892-5
81 978-3-540-68462-6
82 schema:name Advances in Cryptology — CRYPTO '98
83 rdf:type schema:Book
84 N06a00e6546724518b4a5d17c5dacd5dc schema:name dimensions_id
85 schema:value pub.1025704946
86 rdf:type schema:PropertyValue
87 N5d2b349a9b4d46c8a7322a09dfd03cb3 schema:name Springer Nature
88 rdf:type schema:Organisation
89 N6a47c1d5c1844756819822e6e8414d39 schema:familyName Krawczyk
90 schema:givenName Hugo
91 rdf:type schema:Person
92 Nc8b01c0562364e6285af16564e971967 schema:name Springer Nature - SN SciGraph project
93 rdf:type schema:Organization
94 Ncfbae55e3b864eea8bf9c8eb83b4a5af rdf:first N6a47c1d5c1844756819822e6e8414d39
95 rdf:rest rdf:nil
96 Ne78d707de21d4f18a2d61e384b121c6a rdf:first sg:person.015473523512.58
97 rdf:rest rdf:nil
98 Nebea54d7c44346ce9815ce3bac4cb162 schema:name doi
99 schema:value 10.1007/bfb0055722
100 rdf:type schema:PropertyValue
101 anzsrc-for:03 schema:inDefinedTermSet anzsrc-for:
102 schema:name Chemical Sciences
103 rdf:type schema:DefinedTerm
104 anzsrc-for:0306 schema:inDefinedTermSet anzsrc-for:
105 schema:name Physical Chemistry (incl. Structural)
106 rdf:type schema:DefinedTerm
107 sg:person.015473523512.58 schema:affiliation grid-institutes:grid.481554.9
108 schema:familyName Rabin
109 schema:givenName Tal
110 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58
111 rdf:type schema:Person
112 grid-institutes:grid.481554.9 schema:alternateName IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York
113 schema:name IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York
114 rdf:type schema:Organization
 




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


...