摘要
基于RSA的因式分解和离散对数问题,文中提出了一种安全性高,具有良好特性的(t,n)门限群签名方案。其安全性是基于求离散对数和RSA大整数因式分解的困难。方案不仅具有可追踪性和防止群内成员共谋获得系统秘密参数,而且还具有签名验证简单且计算量少,签名的匿名性和防冒充性等优点。
This paper proposes a new (t,n)threshold signature scheme with high security and good property based on factoring of RSA and discrete logarithm. The security of the proposed threshold signature is based on the difficulty of computing the discrete logarithm modulo for a composite number and the factorization problem of large integer. The advantage our of the scheme is not only satisfied with traceability and avoiding the conspiracy, but also satisfied with the verification simply with a little time of computing, anonymity, withstanding the forgery attack and stableness.
出处
《信息技术》
2004年第5期30-32,共3页
Information Technology
关键词
门限群签名
合谋攻击
离散对数问题
因式分解问题
threshold group signatures
conspiracy attack
discrete logarithm problem
factoring problem
