计算机工程

• 安全技术 • 上一篇    下一篇

一种不含双线性对的无证书盲签名方案

何俊杰1,张雪峰2,祁传达1   

  1. (1.信阳师范学院数学与信息科学学院,河南 信阳 464000; 2.信阳农林学院计算机科学系,河南 信阳 464000)
  • 收稿日期:2014-06-25 出版日期:2015-07-15 发布日期:2015-07-15
  • 作者简介:何俊杰(1981-),男,讲师、硕士,主研方向:信息安全;张雪峰,讲师、硕士;祁传达,教授、博士。
  • 基金项目:
    国家自然科学基金资助项目(61272465);河南省自然科学基金资助项目(142300410320);河南省教育厅科学技术研究基金资助项目(14B520046);信阳师范学院青年基金资助项目(2013-QN-060)。

A Certificateless Blind Signature Scheme Without Bilinear Pairing

HE Junjie 1,ZHANG Xuefeng 2,QI Chuanda 1   

  1. (1.College of Mathematics and Information Science,Xinyang Normal University,Xinyang 464000,China; 2.Department of Computer Science,Xinyang College of Agriculture and Forestry,Xinyang 464000,China)
  • Received:2014-06-25 Online:2015-07-15 Published:2015-07-15

摘要: 为简化传统公钥密码系统中的证书管理过程,消除基于身份公钥密码系统中的密钥托管隐患,提出一种新的无证书盲签名方案,在随机预言模型中对适应性选择消息及身份攻击是存在性不可伪造的,且方案安全性可以归约为离散对数问题的难解性。分析结果表明,与现有签名算法与验证算法相比,该方案由于没有使用耗时较多的双线性对运算和MapToPoint散列函数运算,在计算性能上具有明显优势。

关键词: 盲签名, 无证书密码体制, 椭圆曲线, 离散对数, 随机预言模型, 双线性对, 盲性

Abstract: In order to simplify the certificate management process in the traditional public key cryptosystem and eliminate the security vulnerability brought by the key escrow problem in the identity-based public key cryptosystem,a new certificateless blind signature scheme without pairings is proposed.The scheme is proved to be existentially unforgeable against adaptive chosen message and identity attacks in the random oracle model,and the security is reduced to the hardness of the discrete logarithm problem.Analysis results show that compared with the signature and verification algorithm of many other certificateless blind signature schemes,the proposed scheme has obvious advantages in computational efficiency because of no time-consuming bilinear pairing operation and inefficient MapToPoint hash function.

Key words: blind signature, certificateless cryptosystem, elliptic curve, discrete logarithm, random oracle model, bilinear pairing, blindness

中图分类号: