PODC
2003
ACM
14 years 4 months ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...