计算机应用 ›› 2016, Vol. 36 ›› Issue (10): 2738-2741.DOI: 10.11772/j.issn.1001-9081.2016.10.2738

• 网络空间安全 • 上一篇    下一篇

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

汪雄, 邓伦治   

  1. 贵州师范大学 数学科学学院, 贵阳 550001
  • 收稿日期:2016-04-08 修回日期:2016-06-27 出版日期:2016-10-10 发布日期:2016-10-10
  • 通讯作者: 邓伦治,E-mail:denglunzhi@163.com
  • 作者简介:汪雄(1991—),男,陕西镇安人,硕士研究生,主要研究方向:密码学;邓伦治(1979—),男,贵州桐梓人,教授,博士,主要研究方向:密码学。
  • 基金资助:
    国家自然科学基金资助项目(61562012)。

Provably secure undeniable signature scheme based on identity

WANG Xiong, DENG Lunzhi   

  1. School of Mathematical Science, Guizhou Normal University, Guiyang Guizhou 550001, China
  • Received:2016-04-08 Revised:2016-06-27 Online:2016-10-10 Published:2016-10-10
  • Supported by:
    BackgroundThis work is partially supported by the National Natural Science Foundation of China (61562012).

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

关键词: 基于身份密码, 不可否认签名, 双线性对, 随机预言模型

Abstract: 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.

Key words: identity-based cryptography, undeniable signature, bilinear pairing, random oracle model

中图分类号: