Efficient, Robust and Constant-Round Distributed RSA Key Generation

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

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

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

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Removing the Strong RSA Assumption from Arguments over the Integers, Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares, Efficient integer span program for hierarchical threshold access structure, Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, 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 Secure Two-Party Exponentiation

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item