一种高效的可验证的门限签名方案

针对现有的(t,n)门限签名方案中所存在的当群内任何t个或更多个秘密分享成员联合攻击，能暴露系统的秘密密钥的问题，设计了一种能抵制群内成员联合攻击的可证实的具有系统稳定性的门限签名方案。该方案的安全性是基于求离散对数和RSA大整数因式分解的困难，其群签名长度和群签名的验证时间只相当于一般个人签名。
关 键 词 门限群签名; 可验证性; 高效性; 离散对数; 因式分解问题

Abstract Group oriented (t,n) threshold digital signature schemes have a problem in that the underlying signature schemes will be broken if any t or more shadowholders conspire together with each other,thus the group secret key will be revealed.The new scheme proposed by us can avoid the conspiracy attack.It is based on the difficulty of computing the discrete logarithm modulo for a composite number and the factorization problem of large integer.The size of the group signature and verification time of the group signature are equivalent to that of an individual signature.
Key words threshold group signature; verification; efficiency; discrete logarithm; factoring problem