基于椭圆曲线的可验证门限签名方案

A verifiable threshold signature scheme based on the elliptic curve

提出一种基于椭圆曲线的(t,n)可验证门限签名方案.其安全性不但依赖于椭圆曲线离散对数的分解难度,而且依赖于椭圆曲线的选取和体制.经分析得知该方案的通信复杂度远远小于Kazuo等人的方案,在抵抗选择明文攻击方面同Nyberg Ruepple签名方案一样安全.

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 NybergRueppel signature scheme.