摘要：

在基于双线性对的代理签名方案中，对运算最为耗时，应尽量减少对运算的次数。为此，提出一种新的基于双线性对的代理签名方案，其安全性基于离散对数问题的难解性和计算Diffie-Hellman问题的困难性。安全性分析结果表明，该方案安全有效，能抵抗强伪造攻击，满足强代理签名的性质。与其他类似方案相比，具有更高的计算效率。

关键词: 双线性对, 代理签名, 不可伪造性

Abstract:

In the proxy signature schemes from pairings, the pairing operations are the most time-consuming. In order to reduce times of the pairing operations, this paper proposes a new proxy signature from bilinear pairings. The security of the scheme depends on the hardness assumption of discrete logarithm problem and the computation Diffie-Hellman problem. Its security is analyzed and the result shows that this scheme is secure and effective, it can effectively resist the strong forgery attacks and satisfy the security properties of strong proxy signature. Compared with other schemes, the new scheme has better computational efficiency.

Key words: bilinear pairings, proxy signature, unforgeability

中图分类号: 

• TP309.2