Computing inverses over a shared secret modulus

MaRDI QIDQ3374909zbMATH OpenFDO

Authors Dario Catalano, Rosario Gennaro, Shai Halevi

Publication date 1 March 2006

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Reducing the Complexity in the Distributed Computation of Private RSA Keys
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• Efficient distributed computation modulo a shared secret
• Robust and efficient sharing of RSA functions.
• scientific article; zbMATH DE number 1942435

Cited in

(5)

• The k-ary Montgomery modular inverse over nonbinary computers
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• Reducing the Complexity in the Distributed Computation of Private RSA Keys
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Efficient e=3 threshold RSA via integer coordinates for Intel SGX

This page was built for publication: Computing inverses over a shared secret modulus

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