Practical Threshold RSA Signatures Without a Trusted Dealer

Ivan B. Damgård
Maciej Koprowski

November 2000


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

Available as PostScript, PDF, DVI.


Last modified: 2003-06-08 by webmaster.