Abstract: This paper presents an identity-based proxy signature scheme to solve the proxy signature problem, which includes such five algorithms: setup, enroll, sign, verify and Trace. With the theory and approach of provable security, it proves that under the Computational Diffie-Hellman(CDH) and the subgroup decision assumptions, the scheme has the properties of anonymity and traceability.

Key words: bilinear pairings, proxy signature, provable security

摘要： 针对实际应用中的代理签名问题，提出一个基于身份的代理签名方案，包括系统初始化、注册、签名、验证及追踪5个算法。应用可证明安全性的理论和方法，证明在CDH问题难解及子集判定问题难解的假设下，该方案具有代理者的匿名性与身份的可追查性。

关键词: 双线性对, 代理签名, 可证明安全性

CLC Number: 

• TP309