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

Abstract: To improve the computational efficiency, this paper proposes an efficient provably secure certificateless proxy signature scheme based on elliptic curve discrete logarithm problem, avoiding bilinear pairing. The proposed scheme is more computationally efficient than the existing schemes. Its generate-partial-proxy-key algorithm needs one scalar multiplication, its validate-partial-proxy-key algorithm needs two scalar multiplications, and its signing algorithm only needs one scalar multiplication, its validation algorithm only needs six scalar multiplications. Furthermore, its signature length is shorter. The proposed scheme is existentially unforgeable in adaptive chosen message and iden-  tity for super adversary, and is particularly suitable for practical applications with limited bandwidth and power- constrained devices.

Key words: certificateless public key cryptography, proxy signature, elliptic curve discrete logarithm problem, random oracle model