Abstract: Because of the large amount of calculation for pairing, a partially blind signature scheme without pairing was proposed, which combined the new certificateless public key cryptosystem. The security of the new scheme was analyzed with the random oracle model. The results show that the new scheme satisfies the unforgeability and the partial blindness. On the basis of the Discrete Logarithm Problem (DLP) and CDH (Computational Diffie-Hellman) assumption, the computational ability of the new scheme is better than other certificateless ones, and it can be applied to construct secure mobile e-commerce.

Key words: partially blind signature, certificateless, bilinear pairing, Discrete Logarithm Problem (DLP), partially blind

摘要： 由于对运算的计算量较大，结合新的无证书的公钥密码体制，提出一种无需对运算的无证书部分盲签名方案。采用随机预言机模型，分析了新方案的安全性，结果表明，新方案满足不可伪造性和部分盲性。新方案基于离散对数问题和计算性Diffie-Hellman（CDH）假设，计算开销明显优于其他无证书部分盲签名方案，可适用于移动电子商务。

关键词: 部分盲签名, 无证书, 双线性对, 离散对数问题, 部分盲性