A new threshold signature scheme based on ECC and factoring

Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm or elliptic curve discrete logarithm problems. In this paper, we proposed a new threshold signature scheme based on multiple hard problems namely factoring and elliptic curve discrete logarithm problems. We combined the two problems into both signing and verifying equations. The new scheme was shown to be secure against the known attacks for signature schemes. The efficiency performance of our scheme is given. Our scheme provides longer and higher security level than that scheme based on one problem.