基于椭圆曲线的强无证书盲签名方案

A strong certificate free blind signature scheme based on elliptic curve

通过对刘二根等提出的无证书盲签名方案的分析,发现该方案在验证过程中比黄如芬等提出的方案耗时长,生成密钥所占内存大等问题,提出一种基于椭圆曲线离散对数难题(ECDLP)的无证书部分盲签名算法。该算法采用椭圆曲线上的点乘运算代替双线性对运算,提高了签名和验证过程中的计算效率(节约了),并对改进后的方案作了安全性分析。对比其他三种同类型的方案,结果表明,改进后的方案计算开销远远低于其它几种同类型的方案,具有广泛实用价值。

Through the analysis of the uncertificated blind signature scheme proposed by liu ergan, the scheme has taken more time than the proposed scheme in the verification process. In this paper, a blind signature algorithm based on elliptic curve discrete logarithm problem （ECDLP） is proposed. The algorithm uses the dot multiplication on elliptic curve to replace the bilinear pair operation, and reduces the computational efficiency in the process of signature and verification. And security analysis of the improved scheme, compared with the other three types of solution, the results show that the improved scheme computing cost is much lower than other several schemes of the same type, and has a widely practical value.