An efficient threshold signature scheme based on the elliptic curve cryptosystem

The work presents an efficient identification threshold signature scheme based on the elliptic curve cryptosystem, with a view to optimizing these techniques for implementation within a network. (Any t out of n users in a group can represent this group to sign the group signature) as compared with the existing threshold signature scheme based on the public key system of RSA and ELGmal, our scheme need less parameters but can provide more efficient and super security. Moreover it is constructed on the two base points but other threshold signature scheme constructed on the only one point. The distinguishing feature of the proposed scheme is that the threshold value denotes the minimum number of members required to produce a valid group signature. All message recipients then can verify the signature.