Efficient distributed computation modulo a shared secret

MaRDI QIDQ5489058zbMATH OpenFDO

Authors Dario Catalano

Publication date 25 September 2006

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient computation modulo a shared secret with application to the generation of shared safe-prime products
• Efficient generation of shared RSA keys. (Extended abstract)
• Efficient generation of shared RSA keys
• scientific article; zbMATH DE number 1775456
• Efficient, Robust and Constant-Round Distributed RSA Key Generation

Cited in

(8)

• Experimental performance of shared {RSA} modulus generation
• Efficient Multiplicative Sharing Schemes
• Computing inverses over a shared secret modulus
• Reducing the Complexity in the Distributed Computation of Private RSA Keys
• Efficient generation of shared RSA keys. (Extended abstract)
• Efficient computation modulo a shared secret with application to the generation of shared safe-prime products
• scientific article; zbMATH DE number 907956 (Why is no real title available?)
• Efficient generation of shared RSA keys

This page was built for publication: Efficient distributed computation modulo a shared secret

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