Efficient, Robust and Constant-Round Distributed RSA Key Generation

DOI10.1007/978-3-642-11799-2_12MaRDI QIDQ3408194zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1775456
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Efficient generation of shared RSA keys
• scientific article; zbMATH DE number 1088251
• Efficient and robust two-party RSA key generation
• Robust and efficient sharing of RSA functions
• scientific article; zbMATH DE number 1424179
• Advances in Cryptology - EUROCRYPT 2004
• RSA verifiable signature sharing scheme based on secure distributed key generations
• An RSA verifiable signature sharing scheme based on secure distributed key generations

Cites work

• scientific article; zbMATH DE number 1186946 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 1088251 (Why is no real title available?)
• scientific article; zbMATH DE number 1942435 (Why is no real title available?)
• scientific article; zbMATH DE number 1775456 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Advances in Cryptology - ASIACRYPT 2003
• Average Case Error Estimates for the Strong Probable Prime Test
• Efficient generation of shared RSA keys
• Efficient proofs that a committed number lies in an interval
• How to share a secret
• On the Theory and Practice of Personal Digital Signatures
• Probabilistic algorithm for testing primality
• Public Key Cryptography - PKC 2006
• Theory of Cryptography

Cited in

(20)

• 2D hash chain robust random key distribution scheme
• Amortizing division and exponentiation
• Multiparty generation of an RSA modulus
• Reducing the Complexity in the Distributed Computation of Private RSA Keys
• On the security of distributed multiprime RSA
• A signature scheme for a dynamic coalition defence environment without trusted third parties
• Efficient integer span program for hierarchical threshold access structure
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Multiparty generation of an RSA modulus
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
• scientific article; zbMATH DE number 1775456 (Why is no real title available?)
• How to challenge and cast your e-vote
• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
• Removing the strong RSA assumption from arguments over the integers
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient distributed computation modulo a shared secret
• scientific article; zbMATH DE number 1740041 (Why is no real title available?)
• Efficient secure two-party exponentiation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408194)