Abstract: A (t, n) threshold signature scheme is presented and is provably secure in the standard model. The proposed construction possesses public verifiability and detects the dishonest participants by using Gennaro’s distributed key generation (DKG) protocol and the bilinear pairing. Its key generation does not require a trusted dealer in the key generation protocol and only runs an interactive protocol among n participants. This new scheme proves robust and secure against existential forgery under the adaptive chosen message attack, assuming that the computation Diffie-Hellman assumption holds.

Key words: (t,n) threshold signature scheme, the standard model, provable secure, computation Diffie-Hellman assumption