Proactive RSA
Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung
Abstract (abbrev. by library): We consider a "mobile adversary" which may corrupt all participants throughout the lifetime of the system in a non-monotonic fashion (i.e. recoveries are possible) but the adversary is unable to corrupt too many participants during any short time period. Schemes resiliant to such adverasry are called proactive. We present a proactive RSA system in which a threshold of servers applies the RSA signature (or decryption) function in a distributed manner. Employing new combinatorial and elementary number theoretic techniques, our protocol enables the dynamic updating of the servers (which hold the RSA key distributively); it is secure even when a linear number of the servers are corrupted during any time period; it efficiently "self-maintains" the security of the function and its messages (ciphertexts or signatures); and it enables continuous availability, namely, correct function application using the shared key is possible at any time.
Keywords: RSA, secret sharing, function sharing, proactive security, robust secure distributed computation
comment: received Aug 5th, 1996. Original version published in: Proactive RSA, Sandia Report SAND96-0856, March 1996.
contact author: yair@cs.sandia.gov
Fetch PostScript file of the full paper.