Verifiable (t, n) threshold signature scheme based on elliptic curve
Wang Hua-qun, Zhao Jun-xi, Lijun Zhang · Wuhan University Journal of Natural Sciences · 2005
Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifible key agreement scheme without trusted party. Applying a modified clliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (elliptic curve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security. Based on the difficulty of solving the ECDLP (elliptic curve discre logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified clliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (elliptic curve digital signature algorithm) form the computability and security view. Our scheme has a shorter key, faster computation, and better security.