| 基于离散对数问题的一般盲签名方案 |
| |
| 引用本文： | 敖青云,陈克非,白英彩. 基于离散对数问题的一般盲签名方案[J]. 计算机工程与应用, 2001, 37(1): 12-13,35 |
| |
| 作者姓名： | 敖青云 陈克非 白英彩 |
| |
| 作者单位： | 上海交通大学计算机科学与工程系 |
| |
| 基金项目： | 国家“863”高科技发展计划课题资助!课题编号：863－306－ZT02－06－3。 |
| |
| 摘 要： | 盲签名是一种所签的消息对签名者不可知的数字签名。从１９８３年 Ｄａｖｉｄ Ｃｈａｕｍ首先提出了盲签名的概念以来，许多实现方案相继推出。文章提出了基于离散对数问题的一般盲签名方案，对其完备性、不可伪造性、安全性以及盲性进行了分析，并给出了用该方案设计一个有效的盲签名协议应该满足的参数规则。
|
| 关 键 词： | 离散对数 盲签名 密码协议 |
A General Blind Signature Scheme Based on the Discrete Logarithm Problem |
| |
| AO Qingyun,CHEN Kefei,Bai Yingcai. A General Blind Signature Scheme Based on the Discrete Logarithm Problem[J]. Computer Engineering and Applications, 2001, 37(1): 12-13,35 |
| |
| Authors: | AO Qingyun CHEN Kefei Bai Yingcai |
| |
| Abstract: | A blind signature is a digital signature in which the message to be signed is blind to the signer. After David Chaum introduced this concept in 1983,many implementations have come into being. In this paper,we present a general blind signature scheme based on the discrete logarithm problem. Then,a detailed analysis on its completeness, unforgeability,security and blindness is given. We also discuss some rules,which have to be followed to design a valid discrete -logarithm-based blind signature protocol with this scheme. |
| |
| Keywords: | discrete logarithm blind signature cryptographic protocol |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
