00000cab a22000003a 4500 UP-99796217608727501 Buklod 20231007234724.0 m |o d | ta 090226s xx d | ||r ||||| || (iLib)UPD-00077096412 DENGII eng Boneh, Dan Efficient generation of shared RSA keys. pp. 702-722 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 scenario (passive adversary). Data. Data encryption. Public key cryptosystems. Security. Journal of the ACM 48, 4 (2001). FO UPD DENG-II Article