| 辫群上的强盲签名体制 |
| |
| 作者姓名： | 隗云 熊国华 张兴凯 鲍皖苏 |
| |
| 作者单位： | 1. 信息工程大学电子技术学院,郑州 450004;
2. 空军电子技术研究所,北京 100195;
3. 96610部队,北京 102208 |
| |
| 基金项目： | 国家自然科学基金(10501053)资助 |
| |
| 摘 要： | 在辫群上定义了一种新的数学问题——多一求根问题.基于该问题的难解性构造了一个强盲签名体制,并证明其在随机预言模型下能抵抗适应性选择的消息的多一存在性伪造攻击.与共轭盲签名体制相比,新体制的优势在于计算效率更高、签名长度更短.
|
| 关 键 词： | 盲签名 辫群 多一求根问题 随机预言模型 |
| 收稿时间： | 2010-06-16 |
| 修稿时间： | 2010-09-03 |
A strong blind signature scheme over the braid groups |
| |
| Authors: | WEI Yun XIONG Guo-Hua ZHANG Xing-Kai BAO Wan-Su |
| |
| Institution: | 1. Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, China;
2. Institute of Electronic Technology of the Air Force, Beijing 100195, China;
3. Unit 96610, Beijing 102208, China |
| |
| Abstract: | A new computational problem over braid groups, one-more root extraction problem, is described, and a new strong blind signature scheme is constructed. The constructed scheme can resist one-more existential forgery against the adaptively chosen message attack under the random oracle model and has advantage over the conjugate blind signature schemes in computational efficiency and shortening signature. |
| |
| Keywords: | blind signature braid group one-more root extraction problem random oracle model |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
|
