Abstract: An efficient proxy ring signature scheme is proposed，the proxy ring signature scheme overcomes the common weakness that the operation field is unreasonable in the step of proxy key generation in the existed proxy ring schemes.The computational cost of bilinear pairings is reduced from O（n） to O（1），the computational efficiency is improved.The unforgeability is proved depending on the CDHP.The proxy ring signature scheme also satisfy the other security requirements of a proxy ring signature scheme： unconditional ambiguity，verifiability，distinguishability.

Key words: ring signature, proxy signature, proxy ring signature, provably security, Computation Diffie-Hellman Problem（CDHP ）

摘要： 提出了一个有效的代理环签名方案，此方案克服了以往基于身份的方案在代理钥生成时运算域不合理的弱点。同时使方案的有效性提高：双线对的计算开销从O（n）降到了O（1）。在计算性Diffie-Hellman问题（CDHP）困难假设下，证明了它的不可伪造性。提出的方案也满足代理环签名方案的其他安全性要求：无条件匿名性、可验证性、可区分性。

关键词: 环签名, 代理签名, 代理环签名, 可证明安全, 计算性Diffie-Hellman问题