A verifiable threshold signature scheme based on the elliptic curve
Han Jin · Journal of Xidian University · 2003
The paper presents a (t,n) verifiable threshold signature scheme based on the elliptic curve. Its security depends not only on the elliptic curve discrete logarithm but also on the choice of the elliptic curve and its system. By analyzing the scheme, we conclude that its communication complexity is lower than the scheme proposed by Kazuo etc. and its security against chosen message attack is the same as in the case of NybergRueppel signature scheme.