Skip to Main Content
Based on the elliptic curve logarithm problem, a (t, n) threshold digital signature scheme was proposed in this paper. In the key generation phase, each participantÂ¿s public and private keys, and the group public key are negotiated among all the participants with no trusted party required. In the signature generation phase, no secure communication is needed between any two participants. This scheme provides the capability of detecting cheating and identifying the cheat that may be from the internal participants or the external attackers. At the same time, this scheme has the advantages of elliptic curve cryptography. The security of this scheme is based on the difficulty of solving the elliptic curve discrete logarithm problem. Analyses show that this scheme is a computationally secure and efficient scheme.