Conference ProceedingsOPEN ACCESS

Efficient, robust and constant-round distributed RSA key generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5978 LNCS 183-200
DOI: 10.1007/978-3-642-11799-2_12
35Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2010 Springer.

Cite

CITATION STYLE

APA

Damgård, I., & Mikkelsen, G. L. (2010). Efficient, robust and constant-round distributed RSA key generation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5978 LNCS, pp. 183–200). Springer Verlag. https://doi.org/10.1007/978-3-642-11799-2_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free