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

A Certificateless Blind Signature Scheme Without Bilinear Pairing

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

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.