RSA (safe-prime moduli) ⇒ Threshold RSA signatures (Shoup)
Statement
Let for primes and with and prime, let the dealer choose the public exponent , a prime greater than the number of parties, by an efficient rule , and let hash messages into . In Shoup’s threshold RSA scheme a trusted dealer shares the RSA signing exponent among the parties, and any honestly generated signature shares combine into the RSA full-domain-hash signature with . Against a static adversary corrupting parties, with and , the scheme is unforgeable and robust in the random-oracle model if RSA is hard for for every polynomial — Sho00.
Notes
- Signature shares are generated and verified without interaction, and each share is at most a constant times the length of — Sho00.
- Since is coprime to , the combined signature is the unique -th root of modulo , so it does not depend on which parties produced it, and verifiers run plain RSA full-domain-hash verification — standard.