Sciweavers

Share
NDSS
1999
IEEE

Experimenting with Shared Generation of RSA Keys

12 years 11 days ago
Experimenting with Shared Generation of RSA Keys
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved in the computation are convinced that N is a product of two large primes, however none of them know the factorization of N. In addition, a public encryption exponent is publicly known and each server holds a share of the private exponent. Such a sharing of an RSA key has many applications and can be used to secure sensitive private keys. Previously, the only known method to generate a shared RSA key was through a trusted dealer. Our implementation demonstrates the e ectiveness of shared RSA key generation, eliminating the need for a trusted dealer.
Michael Malkin, Thomas D. Wu, Dan Boneh
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where NDSS
Authors Michael Malkin, Thomas D. Wu, Dan Boneh
Comments (0)
books