Reducing the Complexity in the Distributed Computation of Private RSA Keys

DOI10.1007/978-3-642-02620-1_18MaRDI QIDQ3634497zbMATH OpenOpenAlexFDO

Authors Peter Lory

Publication date 25 June 2009

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02620-1_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the Computational Security of a Distributed Key Distribution Scheme
• On the security of distributed multiprime RSA
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• scientific article; zbMATH DE number 1775456
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• scientific article; zbMATH DE number 1088251
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Distributed Public-Key Cryptography from Weak Secrets
• scientific article; zbMATH DE number 1941251

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Computing inverses over a shared secret modulus
• Efficient distributed computation modulo a shared secret
• How to share a secret
• scientific article; zbMATH DE number 1821102 (Why is no real title available?)
• scientific article; zbMATH DE number 824937 (Why is no real title available?)
• Modern cryptography: theory and practice
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

Cited in

(2)

• An asynchronous protocol for distributed computation of RSA inverses and its applications
• Computing inverses over a shared secret modulus

This page was built for publication: Reducing the Complexity in the Distributed Computation of Private RSA Keys

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