An asynchronous protocol for distributed computation of RSA inverses and its applications

DOI10.1145/872035.872058MaRDI QIDQ2943753zbMATH OpenOpenAlexFDO

Authors Christian Cachin

Publication date 4 September 2015

Published in Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/872035.872058

zbMATH Keywords

Byzantine agreementcryptographythreshold signaturesverifiable random functionsverifiable secret sharing

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Computing inverses over a shared secret modulus
• Reducing the Complexity in the Distributed Computation of Private RSA Keys
• A provably secure asynchronous proactive RSA scheme
• Random oracles in constantipole
• scientific article; zbMATH DE number 1583939

Cited in

(3)

• High-threshold AVSS with optimal communication complexity
• Computing inverses over a shared secret modulus
• Reducing the Complexity in the Distributed Computation of Private RSA Keys

This page was built for publication: An asynchronous protocol for distributed computation of RSA inverses and its applications

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