| 一种改进的群签名方案 |
| |
| 引用本文： | 司光东,李艳平,肖国镇.一种改进的群签名方案[J].西安电子科技大学学报,2007,34(1):106-109. |
| |
| 作者姓名： | 司光东 李艳平 肖国镇 |
| |
| 作者单位： | [1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071 [2]陕西师范大学数学与信息科学学院,陕西西安710062 |
| |
| 摘 要： | 指出了张键红等提出的群签名方案在模运算下的错误，利用同模算法证明了原方案可以被完全攻破，然后对它进行改进,改进方案是在RSA假设和离散对数假设下构造的，它吸收了原方案可以抵抗伪造攻击等优点，并且弥补了原方案的漏洞．在签名算法和验证阶段中仅用6次模指数运算，效率较原方案提高了近一倍．
|
| 关 键 词： | 数字签名 群签名 安全性分析 离散对数 |
| 文章编号： | 1001-2400（2007）01-0106-04 |
| 修稿时间： | 2006-04-13 |
An improvement on group signature |
| |
| SI Guang-dong,LI Yan-ping,XIAO Guo-zhen.An improvement on group signature[J].Journal of Xidian University,2007,34(1):106-109. |
| |
| Authors: | SI Guang-dong LI Yan-ping XIAO Guo-zhen |
| |
| Affiliation: | (1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi′an 710071， China; 2. College of Mathematics and Information Science, Shaanxi Normal Univ., Xi′an 710062， China) ; |
| |
| Abstract: | 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. |
| |
| Keywords: | digital signature group signature security analysis discrete logarithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《西安电子科技大学学报》浏览原始摘要信息 |
|
点击此处可从《西安电子科技大学学报》下载全文 |
