@prefix ns1: .
@prefix ns2: .
@prefix rdf: .
@prefix rdfs: .
@prefix xml: .
@prefix xsd: .
a ns1:Chapter ;
ns1:about ,
;
ns1:author ( ) ;
ns1:datePublished "1998" ;
ns1:datePublishedReg "1998-01-01" ;
ns1: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." ;
ns1:editor ( [ a ns1:Person ;
ns1:familyName "Krawczyk" ;
ns1:givenName "Hugo" ] ) ;
ns1:genre "chapter" ;
ns1:inLanguage "en" ;
ns1:isAccessibleForFree true ;
ns1:isPartOf [ a ns1:Book ;
ns1:isbn "978-3-540-64892-5",
"978-3-540-68462-6" ;
ns1:name "Advances in Cryptology — CRYPTO '98" ] ;
ns1:keywords "Proactive RSA",
"RSA",
"RSA modulus",
"RSA problem",
"additive form",
"approach",
"availability",
"computation",
"constant time",
"design",
"easy design",
"error",
"existence",
"faults",
"faulty players",
"form",
"general technique",
"key",
"key size",
"lifetime",
"minority",
"modulus",
"new general technique",
"number",
"number of faults",
"number of players",
"players",
"previous protocols",
"previous solutions",
"proactive RSA problems",
"proactivization",
"probability",
"probability of error",
"problem",
"process",
"protocol",
"refreshing process",
"resilience",
"results",
"robust computation",
"robust threshold RSA",
"run time",
"signing",
"signing key",
"simple signing",
"simplified approach",
"size",
"solution",
"straightforward refreshing process",
"system",
"technique",
"threshold",
"threshold RSA",
"time" ;
ns1:name "A simplified approach to threshold and proactive RSA" ;
ns1:pagination "89-104" ;
ns1:productId [ a ns1:PropertyValue ;
ns1:name "doi" ;
ns1:value "10.1007/bfb0055722" ],
[ a ns1:PropertyValue ;
ns1:name "dimensions_id" ;
ns1:value "pub.1025704946" ] ;
ns1:publisher [ a ns1:Organisation ;
ns1:name "Springer Nature" ] ;
ns1:sameAs ,
;
ns1:sdDatePublished "2022-01-01T19:06" ;
ns1:sdLicense "https://scigraph.springernature.com/explorer/license/" ;
ns1:sdPublisher [ a ns1:Organization ;
ns1:name "Springer Nature - SN SciGraph project" ] ;
ns1:url "https://doi.org/10.1007/bfb0055722" ;
ns2:license ;
ns2:sdDataset "chapters" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Chemical Sciences" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Physical Chemistry (incl. Structural)" .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Rabin" ;
ns1:givenName "Tal" ;
ns1:sameAs .
a ns1:Organization ;
ns1:alternateName "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York" ;
ns1:name "IBM T.J. Watson Research Center, PO Box 704, 10598, Yorktown Heights, New York" .