摘要
基于目前团体签名的实际需要及数字签名的研究 ,结合交互式零知识证明的概念 ,提出了一种新的门限数字签名算法。该算法的安全性建立在对大数的因子分解和RSA加密算法破解的难度上 ,且该方案无须在任何代数结构中对任何元素求逆 ,从而也无须对任何代数结构做扩张 ,可以防止非法用户或签名执行者伪造签名。
A new threshold digital signature using the research result about the digital signature with zero knowledge proof was proposed in this paper. The security of this algorithm is based on large number of factorizations and security of RSA. The scheme doesn’t need to invert any elements in any structure, and then no algebraic extension is needed for any structure. It is useful for the information security.
出处
《青岛科技大学学报（自然科学版）》
CAS
2004年第4期367-369,共3页
Journal of Qingdao University of Science and Technology:Natural Science Edition
关键词
门限数字签名
交互式零知识证明
秘密共享
the threshold digital signature
zero-knowledge proof
secret shared
