Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Cite this paper as:
- Damgård I., Mikkelsen G.L. (2010) Efficient, Robust and Constant-Round Distributed RSA Key Generation. In: Micciancio D. (eds) Theory of Cryptography. TCC 2010. Lecture Notes in Computer Science, vol 5978. Springer, Berlin, Heidelberg
We present the first protocol for distributed RSA key generation which is constant round, secure against malicious adversaries and has a negligibly small bound on the error probability, even using only one iteration of the underlying primality test on each candidate number.