可证明安全的基于身份的不可否认签名方案

Provably secure undeniable signature scheme based on identity

针对基于身份的不可否认签名方案计算效率低的问题,提出了一个新的基于身份的不可否认签名方案。基于计算双线性Diffie-Hellman(CBDH)问题和判断双线性Diffie-Hellman(DBDH)问题的困难性假设,该方案在随机预言模型下被证明是不可伪造和不可见的,并且该方案减少了双线对的运算次数。分析表明,该方案比Libert、Duan、Behnia等提出的不可否认签名方案具有更高的计算效率,更适用于计算受限的场合。

Concerning the low efficiency of identity-based undeniable signature schemes, a new identity-based undeniable signature scheme was proposed. Under the assumption that it is hard to solve the Computational Bilinear Diffie-Hellman （CBDH） problem and the Decisional Bilinear Diffie-Hellman （DBDH） problem, the proposed scheme was proven to be unforgeable and invisible in the random oracle model, and it reduced the number of bilinear pairing operations. Analysis shows that the proposed scheme is more efficient than undeniable signature schemes proposed by Libert, Duan and Behnia, and it is more suitable for the computation-constrained environment.