摘要
利用谷科最近提出的签名方案,设计了一个在标准模型下可证明安全的高效的基于身份的门限签名方案,它的门限密钥生成算法不需要可信第三方。通过减少群元素乘法运算和双线性对运算来提高计算效率,尤其是通过预先计算双线对的方法来提高方案的在线计算能力。同时,在标准模型下被证明具有在自适应选择消息攻击下存在不可伪造性,其安全性可以规约于一般的困难问题假设—CDH问题。与现有的标准模型下基于身份的门限签名方案相比,该方案具有更高的效率。
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 ora- cle）. The generation of the threshold key does not require a trusted third party. The new scheme im- proves 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 adap- tive chosen message attack under the computation Diffie-Heilman assumption in the standard model. Compared with the current ID-based threshold signature scheme, the new one is more computational ef- ficient.
出处
《计算机工程与科学》
CSCD
北大核心
2013年第8期36-40,共5页
Computer Engineering & Science
基金
国家自然科学基金资助项目(61272492
61103231
61103230)
关键词
门限签名
标准模型
CDH问题
可证明安全
threshold signature
standard model
CDH-problem
provable security
