北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (4): 53-57.doi: 10.13190/jbupt.200804.53.016

• 论文 • 上一篇    下一篇

高效的基于身份的(受限)部分盲签名

崔 巍1,辛 阳1,胡程瑜2,杨义先1,李忠献1,3   

  1. 1.北京邮电大学 网络与交换技术国家重点实验室,北京 100876;2. 山东大学 计算机科学与技术学院,济南250100;3. 天津市国瑞数码安全系统有限公司 北京研发中心,北京 100088
  • 收稿日期:2007-10-17 修回日期:1900-01-01 出版日期:2008-08-30 发布日期:2008-08-30
  • 通讯作者: 崔 巍

Efficient ID-Based (Restrictive) Partially Blind Signature

CUI Wei1,XIN Yang1,HU Cheng-yu2,YANG Yi-xian1,LI Zhong-xian1,3   

  1. 1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876,China; 2. College of Computer Science and Technology, Shandong University, Jinan 250061,China; 3. Beijing Research and Development Center, Tianjing National Cybernet Security Limited, Beijing 100088,China)
  • Received:2007-10-17 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
  • Contact: CUI Wei

摘要:

提出了一个新的基于身份的部分盲签名方案,其安全性基于q-强Diffie-Hellman困难问题,证明了该方案在随机预言模型下能防止伪造攻击。该方案不需要低效的MapToPoint哈希函数,仅使用了1个配对运算,效率高于其他基于身份的部分盲签名方案。在此方案基础上提出了一个高效的基于身份的受限部分盲签名体制,证明了该方案的正确性、不可伪造性、限制性和部分盲性。

关键词: 基于身份的, q-强Diffie-Hellman 问题, 部分盲签名, 受限部分盲签名

Abstract:

A new identity-based partially blind signature scheme was proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, the scheme was proved to be unforgeable in the random oracle model. Compared with other existing schemes, the new scheme performs more efficient in computation because it doesn’t need inefficient MapToPoint hash function and only needs one pairing computation. Based on the scheme mentioned above, a restrictive partially blind signature is proposed and proved to be efficient, correct, unforgeable, as well as restrictive and partially blind.

Key words: identity-based, q-strong Diffie-Hellman problem, partially blind signature, restrictive partially blind signature

中图分类号: