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 parties. Given two numbers x and e, the protocol computes y such that ye=x (mod N). A synchronous protocol for this task has been presented by Catalano, Gennaro, and Halevi (Eurocrypt 2000), but the standard approach for turning this into an asynchronous protocol would require a Byzantine-agreement sub-protocol. Our protocol adopts their approach, but exploits a feature of the problem in order to avoid the use of a Byzantine agreement primitive. Hence, it leads to efficient asynchronous protocols for threshold signatures and for Byzantine agreement based on the strong RSA assumption, without the use of random oracles.... Group, http : //ww . trustedcomputinggroup . org/ J Lettice aBad publicity, clashes trigger MS Palladium name changea, The ... H20020902 . pdf A Huang, a Keeping Secrets in Hardware: the Microsoft Xbox Case Studya, May 26 2002, at http://veb.mit.edu/bunnie/vvw/proj/a.natak/ AIH- 2002-O08 . pdf P Thurrott, a Micr0softa#39;s Secret Plan to Secure the PCa, Winlnfo, June ... pp 358a365, at http:// ww. cl . cam. ac . uk/ftp/users/rja14/econ . pdf C Shapiro, aAntitrust Limits to Patent Settlementsa, anbsp;...
|Title||:||Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed Computing|