Threshold RSA signatures ⇒ Honest-majority threshold signature
Statement
If Shoup’s threshold RSA scheme is unforgeable and robust against static corruption of parties for all polynomials and with , then it is an honest-majority threshold signature scheme (), with the same advantage for every forger: unforgeability for the polynomials with and is part of the hypothesis, robustness is dropped, and the scheme is perfectly correct, since honestly generated shares pass share verification and any of them combine into the RSA full-domain-hash signature on — folklore.