关键词: 无证书密码系统, 代理签名, 双线性映射, 计算Diffie-Hellman问题

Abstract: This paper gives a new construction of certificateless proxy signature scheme using bilinear maps.The security of the scheme is based on the infeasibility of the computational Diffie-Hellman problem and is formally proven in the strongest security model of certificateless proxy signature schemes.The new scheme satisfies the security requirements such as verifiability，strong undeniability，strong identifiability and prevention of misuse for a proxy signature scheme.Due to its security，high efficiency and free of certificate management，it may have practical applications in electronic commerce and electronic auction，etc.

Key words: certificateless cryptography, proxy signature, bilinear map, computational Diffie-Hellman problem