Thumbnail
Access Restriction
Subscribed

Author Boneh, Dan ♦ Franklin, Matthew
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2001
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Multiparty computation ♦ RSA ♦ Primality testing ♦ Threshold cryptography
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 $\textit{N}$ = $\textit{pq}$ is publicly known. None of the parties know the factorization of $\textit{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).
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 48
Issue Number 4
Page Count 21
Starting Page 702
Ending Page 722


Open content in new tab

   Open content in new tab
Source: ACM Digital Library