| 群体盲数字签名协议 |
| |
| 引用本文： | 汪保友,胡运发,袁时金.群体盲数字签名协议[J].计算机研究与发展,2002,39(10):1193-1198. |
| |
| 作者姓名： | 汪保友 胡运发 袁时金 |
| |
| 作者单位： | 1. 复旦大学计算机科学系,上海,200433;中国联通有限公司上海分公司,上海,200233
2. 复旦大学计算机科学系,上海,200433 |
| |
| 基金项目： | 国家“八六三”高技术研究发展计划智能计算机主题基金资助(863-306-ZT04-02-2) |
| |
| 摘 要： | 在双离散对数和离散对数方根知识答名方案基础上加以改进，提出对应的盲签名协议，并在Camenisch的群签名协议基础上，结合前面的双离散对数及离散对数方根盲知识签名，提出一种群体盲答名方案，该方案具有不可伪造性，盲签名性特性，并且其计算，空间和通信复杂度都与安全参数l呈线性关系。
|
| 关 键 词： | 群体盲 数字签名协议 群体盲签名 信息安全 离散对数 |
PROTOCOLS OF GROUP BLIND DIGITAL SIGNATURE |
| |
| Abstract: | Two blinded variants of signatures of knowledge, are described in this paper, including blind signature of knowledge protocols for the double discrete logarithm, and for the root of the discrete logarithm. Then a new group blind digital signature scheme is presented, which involves taking the group signature scheme of Jan Camenisch as basis, and combining with the above two blind signatures of knowledge. The scheme has some good properties, such as unforgeability, and blindness properties, etc. And computational, space, and communication complexities of the scheme are linear in the security parameterl. |
| |
| Keywords: | digital signatures group blind digital signature information security |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
