Theory of Cryptography Conference

TCC 2010: Theory of Cryptography pp 183-200

Efficient, Robust and Constant-Round Distributed RSA Key Generation

  • Ivan Damgård
  • Gert Læssøe Mikkelsen
Conference paper

DOI: 10.1007/978-3-642-11799-2_12

Volume 5978 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Gert Læssøe Mikkelsen
    • 1
  1. 1.Department of Computer ScienceAarhus UniversityDenmark