We present an RSA threshold signature scheme. The scheme enjoys the following properties:
1. it is unforgeable and robust in the random oracle model, assuming the RSA problem is hard;
2. signature share generation and verification is completely non-interactive;
3. the size of an individual signature share is bounded by a constant times the size of the RSA modulus.
By: V. Shoup
Published in: Advances in Cryptology -- Eurocrypt 2000, edited by B. Preneel , Berlin, Springer-Verlag, p.207-20 in 2000
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .