Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (23): 77-80.

Previous Articles     Next Articles

ID-based threshold signature scheme without random oracles

ZHANG Jianzhong1, GAO Huanhuan1,2, ZHAO Bingji3   

  1. 1.College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China
    2.Dingbian Middle School in Yulin of Shaanxi Province, Yulin, Shaanxi 718600, China
    3.Shenyang Blower Works(Group) Pressure Vessel CO., LTD, Shenyang 110000, China
  • Online:2012-08-11 Published:2012-08-21

标准模型下基于身份的门限签名方案

张建中1,高欢欢1,2,赵柄冀3   

  1. 1.陕西师范大学 数学与信息科学学院,西安 710062
    2.陕西省榆林市定边中学,陕西 榆林 718600
    3.沈阳鼓风机集团压力容器有限公司,沈阳 110000

Abstract: Design of threshold signature schemes which are efficient and provably secure in the standard model(without random oracle) is suitable for applications. Based on L-J scheme, the threshold signature scheme is presented and is proved secure in the standard model. The new scheme can tolerate any [t]less than[n/2+1] malicious parties, its key generation algorithm doesn’t need a trusted dealer and it only runs an interactive algorithm among members. The new scheme proves strong and the adaptive chosen message attack is unforgeable under the computation Diffie-Hellman assumption.

Key words: Computation Diffie-Hellman(CDH) problem, threshold signature, standard model, bilinear pairings

摘要: 在标准模型下(不使用随机预言模型)设计可证明安全的门限签名方案具有实际意义。利用L-J方案,设计了一个在标准模型下基于身份的安全的门限签名方案。该方案可容忍[t]小于[n/2+1]个成员被敌手破坏,门限密钥生成算法不需要可信中心,只需成员之间交互协商完成。在计算Diffie-Hellman问题(CDH问题)假设下,该方案是健壮的,且对适应性选择消息攻击是不可伪造的。

关键词: 计算Diffie-Hellman(CDH)问题, 门限签名, 标准模型, 双线性对