Efficient, Robust and Constant-Round Distributed RSA Key Generation

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperConference articleResearchpeer-review

  • Department of Computer Science
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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume5978
Pages (from-to)183-200
Number of pages18
ISSN0302-9743
DOIs
Publication statusPublished - 2010
EventTheory of Cryptography Conference. TCC 2010 - Zürich, Switzerland
Duration: 9 Feb 201011 Feb 2010
Conference number: 7

Conference

ConferenceTheory of Cryptography Conference. TCC 2010
Number7
CountrySwitzerland
CityZürich
Period09/02/201011/02/2010

Bibliographical note

Title of vol.: Theory of Cryptograhy. 7th Conference. Proceedings / Daniele Micciancio (ed.)
ISBN: 978-3-642-11798-5

See relations at Aarhus University Citationformats

ID: 18408184