高效紧安全规约到CDH的签名方案

Efficient Signature Schemes with a Tight Security Reduction to CDH

本文首先基于EDL算法提出了一个改进的签名方案。方案的安全性在随机预言机模型下安全性紧规约到Diffie-Hellman计算问题。由于CDH困难问题被认为是无限接近DL问题,这为签名方案的安全性提供了保证。与EDL算法和它的改进算法相比,该方案需要较少的计算时间,具有较高的计算效率。

This paper proposes an improved signature scheme based on the EDL algorithm. The signature scheme has a tight security reduction to the Computational Diffie-Hellman. Since the CDH problem is considered to be infinitely close to the DL problem,it provides a guarantee for the security of the signature scheme. Compared with the EDL algorithm and its improved algorithm,our scheme requires less computation time,and has higher computational efficiency.