A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Practical Threshold RSA Signatures without a Trusted Dealer
[chapter]
2001
Lecture Notes in Computer Science
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. The robustness (but not the unforgeability) of our scheme depends on a new intractability assumption, in addition to security of the underlying standard RSA scheme.
doi:10.1007/3-540-44987-6_10
fatcat:tei4nrjnyjfgxdfq5lfidxeq7i