一种不使用Hash和Redundancy函数的代理盲签名

Proxy blind signature without using Hash and Redundancy functions

在密码学中,使用Hash函数和Redundancy函数必然使签名方案因这些函数的不安全性而遭受相关攻击,从而导致签名方案的安全性降低。提出了一种不使用Hash和Redundancy函数的代理盲签名,其安全性等价于解离散对数问题,而且避免了使用相关函数带来的威胁。分析表明,新方案实现了电子交易中的不可伪造性和不可链接性,有效防止了双方事后抵赖;而且减少了求幂运算的次数,避免了求Hash函数运算,使签名速度有了较大提高。

In Cryptography, the scheme of signature using Hash and Redundancy functions will be faced with related attacks. Therefore it will result in lower security. So a proxy blind signature scheme without using Hash and Redundancy Functions was proposed, whose security equaled to the difficulty of the discrete logarithm problem. And it avoided the insecurity of the related function. Analysis shows that this scheme has really completed unforgeability and unlinkability in the electronic tractions of business, and prevents the repudiation efficiently. Meantime, the new scheme reduces the computational load for exponentiation, avoids the computation for Hash function and improves the signing speed.