Efficient, Robust and Constant-Round Distributed RSA Key Generation

DOI10.1007/978-3-642-11799-2_12zbMath1274.94059OpenAlexW1533631048MaRDI QIDQ3408194

Gert Læssøe Mikkelsen, Ivan B. Damgård

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_12

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (13)

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ On the Security of Distributed Multiprime RSA ⋮ A Signature Scheme for a Dynamic Coalition Defence Environment Without Trusted Third Parties ⋮ Stamp and Extend – Instant But Undeniable Timestamping Based on Lazy Trees ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Amortizing division and exponentiation ⋮ Efficient integer span program for hierarchical threshold access structure ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Efficient Secure Two-Party Exponentiation ⋮ Multiparty generation of an RSA modulus ⋮ How to Challenge and Cast Your e-Vote ⋮ Multiparty generation of an RSA modulus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• How to share a secret
• Average Case Error Estimates for the Strong Probable Prime Test
• On the Theory and Practice of Personal Digital Signatures
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Efficient generation of shared RSA keys
• Theory of Cryptography
• Public Key Cryptography - PKC 2006
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Efficient, Robust and Constant-Round Distributed RSA Key Generation