Efficient generation of shared RSA keys (1997)
| Venue: | Advances in Cryptology -- CRYPTO 97 |
| Citations: | 112 - 4 self |
BibTeX
@INPROCEEDINGS{Boneh97efficientgeneration,
author = {Dan Boneh and Matthew Franklin},
title = {Efficient generation of shared RSA keys},
booktitle = {Advances in Cryptology -- CRYPTO 97},
year = {1997},
pages = {425--439},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe efficient techniques for a number of parties to jointly generate an RSA key. At the end of the protocol an RSA modulus N = pq is publicly known. None of the parties know the factorization of N. In addition a public encryption exponent is publicly known and each party holds a share of the private exponent that enables threshold decryption. Our protocols are efficient in computation and communication. All results are presented in the honest but curious settings (passive adversary).
