Practical Threshold RSA Signatures Without a Trusted Dealer

Abstract

We propose a threshold RSA scheme which is as efficient as the fastest previous<br />threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup's and in<br />previous schemes can be dropped, namely that the modulus must be a product of safe primes<br />and that a trusted dealer generates the keys.