标准模型下可证安全的基于身份的动态门限签名
Provable Secure ID-based Proactive Threshold Signature in the Standard Model
作者：孙华(北京科技大学信息工程学院)；周芳(北京科技大学信息工程学院)；姚宣霞(北京科技大学信息工程学院)；邓忠军(北京科技大学信息工程学院)
Author：Sun Hua(School of Info. Eng., Univ. of Sci. and Technol. Beijing)；Zhou Fang(School of Info. Eng., Univ. of Sci. and Technol. Beijing)；Yao Xuanxia(School of Info. Eng., Univ. of Sci. and Technol. Beijing)；Deng Zhongjun(School of Info. Eng., Univ. of Sci. and Technol. Beijing)
收稿日期：2009-05-24 年卷（期）页码：2010,42(3):159-163
期刊名称：工程科学与技术
Journal Name：Advanced Engineering Sciences
关键字：标准模型；动态门限签名；计算Diffie-Hellman问题
Key words：standard model; proactive threshold signature; computational Diffie-Hellman problem
基金项目：国家自然科学基金资助项目(60674054)
中文摘要
目前,对于基于身份的动态门限签名方案来说,这些方案的安全性大多是在随机预言模型下证明的,并且这些门限签名方案中的门限值固定。相对而言,设计标准模型下的门限签名方案更有实际意义。针对以上两个问题,根据Paterson提出的基于身份的签名方案,利用计算Diffie-Hellman问题的困难性在标准模型下设计了一个无需可信中心、门限值可变的动态门限签名方案。最后,利用双线性对技术对方案的正确性进行了严格证明,并在CDH困难假设下给出了方案安全性的详细分析过程和证明。结果表明,本文方案是可证安全的和可靠的。
英文摘要
At present, the security of the identity based proactive threshold signature schemes was almost proved in the random oracle model, and the threshold values of these schemes were almost changeless. Aiming at this two problems, a proactive threshold signature scheme was presented by using the hardness of the computational Diffie-Hellman problem with no trusty center and changeable threshold value, based on the modification of Paterson’proposed identity based signature scheme. The scheme’s correctness was exactly proved in terms of bilinear pairing technique and its security was analyzed and proved in detail in the assumption of the computational Diffie-Hellman problem.
【关闭】
