ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem

We present three identification group-oriented (t, n) threshold digital signature schemes based on the elliptic curve discrete logarithm problem, with a view to optimizing these techniques for implementation within a network. By employing these schemes, any t out of n users in a group can represent this group to sign the group signature. This paper has the following five notable advantages: (1) This work demonstrates the feasibility of constructing a fast and extremely secure user identification system. (2) Any group signature can be mutually generated by at least t-group member. (3) The signature verification process is simplified because there is only one group public key required. (4) The group signature can be verified by any outsider. (5) These schemes offer higher speeds, lower power consumption, smaller bandwidth requirements, and smaller certificate sizes than other existing public-key schemes.