Threshold signature scheme based on factoring and discrete logarithms
S. A. Mohamad, Eddie Shahril Ismail · AIP conference proceedings · 2012
Recently, many documents or messages from an organization need to be signed by more than one person. For that reason, many threshold signatures based on various problems in number theory have been developed. In this paper, a threshold signature scheme based on two most popular number theory problems, namely factoring and discrete logarithms, was proposed. The advantage of this new scheme is based on the fact that it is very hard to solve both factoring and discrete logarithms problems simultaneously. This scheme is also shown secure against several attacks and requires a reasonable time complexity in both signing and verifying phase.