首页 | 本学科首页   官方微博 | 高级检索  
     

一个高效的无证书盲签名方案
引用本文:黄茹芬,农强,黄振杰.一个高效的无证书盲签名方案[J].计算机工程,2013,39(2):130-136.
作者姓名:黄茹芬  农强  黄振杰
作者单位:漳州师范学院计算机科学与工程系,福建漳州,363000
基金项目:国家自然科学基金资助项目(61170246);福建省自然科学基金资助项目(2012J01295)
摘    要:结合无证书签名和盲签名的特点,提出一个新的无证书盲签名方案,以简化传统公钥密码体制的密钥管理过程,解决基于身份的公钥密码体制存在的密钥托管问题。分析结果表明,该方案在随机预言机模型、q强Diffie-Hellman困难假设和逆计算Diffie-Hellman困难假设下满足盲性、不可追踪性和不可伪造性,且签名的产生和验证过程仅需一个对运算,具有较高的效率。

关 键 词:无证书签名  盲签名  inv-CDH问题  q-SDH问题  双线性映射  不可伪造性  盲性
收稿时间:2012-03-26
修稿时间:2012-05-14

An Efficient Certificateless Blind Signature Scheme
HUANG Ru-fen , NONG Qiang , HUANG Zhen-jie.An Efficient Certificateless Blind Signature Scheme[J].Computer Engineering,2013,39(2):130-136.
Authors:HUANG Ru-fen  NONG Qiang  HUANG Zhen-jie
Affiliation:(Department of Computer Science and Engineering, Zhangzhou Normal University, Zhangzhou 363000, China)
Abstract:In order to simplify the certificate management process of the traditional public key system and solve the problem about private key escrow in the identity-based public key system, this paper proposes a new certificateless blind signature scheme which combines certificateless signature and blind signature. Analysis result shows that the new scheme is blind, untraceability and unforgeability in random oracle model and under the q-strong Diffie-Hellman complexity assumption and the inversed Diffie-Hellman complexity assumption. The signing algorithm does not require any pairing computation and the verification algorithm only needs a pairing computation, so that the scheme proposed is more efficient.
Keywords:certificateless signature  blind signature  inv-CDH problem  q-SDH problem  bilinear mapping  unforgeability  blindness
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号