摘要
指出了张键红等提出的群签名方案在模运算下的错误,利用同模算法证明了原方案可以被完全攻破,然后对它进行改进.改进方案是在RSA假设和离散对数假设下构造的,它吸收了原方案可以抵抗伪造攻击等优点,并且弥补了原方案的漏洞.在签名算法和验证阶段中仅用6次模指数运算,效率较原方案提高了近一倍.
A new efficient group signature scheme proposed hy J. H. Zhang et al is analyzed. We point out its shortages in the module and prove that this scheme can be attacked completely in the same module algorithm. We present its improved scheme on RSA and discrete logarithm assumption, which contains the merits of the original scheme, unforgeability and anonymity, and gets rid of the original shortages. The total computation of signature and verification take only 6 exponents and the efficiency raised by nearly two times in the improved scheme.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2007年第1期106-109,121,共5页
Journal of Xidian University
基金
国家自然科学基金资助项目(60473028)
关键词
数字签名
群签名
安全性分析
离散对数
digital signature
group signature
security analysis
discrete logarithm
