• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (8): 36-40.

• 论文 • 上一篇    下一篇

高效的基于身份的门限签名方案

郑广亮1,魏立线1,2,王绪安1   

  1. (1.武警工程大学电子技术系网络与信息安全武警部队重点实验室,陕西 西安 710086;2.武警工程大学信息安全研究所,陕西 西安 710086)
  • 收稿日期:2012-10-26 修回日期:2013-01-21 出版日期:2013-08-25 发布日期:2013-08-25
  • 基金资助:

    国家自然科学基金资助项目(61272492,61103231,61103230)

Highefficient identitybased threshold signature scheme         

ZHENG Guangliang1,WEI Lixian1,2,WANG Xuan1   

  1. (1.Key Laboratory of Network & Information Security under the Chinese Armed Police Force,
    Electronic Department,Engineering College of the Armed Police Force,Xi’an 710086;
    2.Institute of Information Security,Engineering College of Chinese Armed Police Force,Xi’an 710086,China)
  • Received:2012-10-26 Revised:2013-01-21 Online:2013-08-25 Published:2013-08-25

摘要:

利用谷科最近提出的签名方案,设计了一个在标准模型下可证明安全的高效的基于身份的门限签名方案,它的门限密钥生成算法不需要可信第三方。通过减少群元素乘法运算和双线性对运算来提高计算效率,尤其是通过预先计算双线对的方法来提高方案的在线计算能力。同时,在标准模型下被证明具有在自适应选择消息攻击下存在不可伪造性,其安全性可以规约于一般的困难问题假设—CDH问题。与现有的标准模型下基于身份的门限签名方案相比,该方案具有更高的效率。

关键词: 门限签名, 标准模型, CDH问题, 可证明安全

Abstract:

Based on the signature scheme proposed by Guke, a new IDbased threshold signature scheme is designed, which is efficient and provably secure in the standard model (without random oracle). The generation of the threshold key does not require a trusted third party. The new scheme improves efficiency by reducing multiplicative operations and bilinear pairing operations, especially by precomputing bilinear pairing operation. And the new scheme is against existential forgery under the adaptive chosen message attack under the computation DiffieHellman assumption in the standard model. Compared with the current IDbased threshold signature scheme, the new one is more computational efficient.

Key words: threshold signature;standard model;CDHproblem;provable security