Cryptology ePrint Archive: Report 1999/011
Practical Threshold Signatures
Abstract: We present an RSA threshold signature scheme. The scheme enjoys the following
it is unforgeable and robust;
in the random oracle model, assuming the RSA problem is hard;
signature share generation and verification is completely non-interactive;
the size of an individual signature share is bounded by a constant
times the size of the RSA modulus.
Category / Keywords: digital signature, threshold cryptography, RSA
Publication Info: Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Date: received April 19, 1999. Revised October 11, 1999.
Contact author: sho at zurich ibm com
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]