Practical Threshold RSA Signatures without a Trusted Dealer

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.

• Type: Conference
• Year: 2001
• Where: EUROCRYPT
• Authors: Ivan Damgård, Maciej Koprowski
• Keywords: Cryptology, EUROCRYPT 2001, Safe Primes, Standard Rsa Scheme, Threshold Rsa Scheme