摘要
对所有的计算机系统而言,安全都是一个非常关键的问题,P2P对等网络系统也不例外。门限签名是一类重要的数字签名,目前常见的门限群签名方案最大的弱点是当恶意成员不小于门限时,能以高概率获取系统秘密,并由此伪造签名。提出一种基于P2P网络的可验证门限群签名方案,该方案的安全性基于求离散对数和RSA大整数因式分解,群内成员合谋无法获得系统秘密参数,从而可以抵制合谋攻击。
Security is the critical concern for all computer systems, and peer-to-peer network is not an exceptant. Threshold signature is a kind of important digital signature, the biggest weakness in common threshold signature schemes is that when the number of malicious share-holders is no less than the threshold, they can obtain the system secret of the group with high probability, and then forge the group signature. A verifiable P2P distributed digital signing system using （t, n） threshold encryption technique is proposed in this paper. The security of the system relies on the difficulty in computing the discrete logarithm and the factorization of RSA large integer. Part of members inside a group cannot get any system secret parameters in collusion,thus the conspiracy attack is withstood.
出处
《计算机应用与软件》
CSCD
2009年第7期88-89,135,共3页
Computer Applications and Software
基金
广西科学基金(桂科基0575014)
关键词
数字签名
群签名
门限群签名
P2P
合谋攻击
Digital signature
Group signature
Threshold group signature
P2P
Conspiracy attack
