基于GDH群可证安全的门限签名方案  

A Provable Secure Threshold Signature Scheme Based on GDH Group

作　　者：彭长根[1] 张晓培[1] 李祥[1] 罗文俊[1] 

机构地区：[1]贵州大学计算机软件与理论研究所

出　　处：《计算机科学》2007年第10期110-111,148,共3页Computer Science

基　　金：国家自然科学基金(60463001);贵州省自然科学基金(编号:20052107);贵州省省长基金(编号:2005368)

摘　　要：分析了Boneh等人的短签名方案和Boldyreva门限签名方案因不具备概率签名特性而可能存在的一种对比攻击;然后基于Gap Diffie-Hellman(GDH)群设计了一个概率型的门限签名方案,并在随机预言模型(Random Oracle Model)下证明了方案的安全性。所提出的方案可以避免时比攻击的风险,并且其安全性不低于Boldyreva方案的安全性,即提供了健壮性和在选择消息攻击下的不可伪造性,并能容忍t<n/2个恶意用户的勾结。本文的方案可作为Boldyreva方案的改进。There exist the possibility of comparison attacks on the Boneh et al. ＇s short signature and the Boldyreva＇s threshold signature due to their schemes couldn＇t provide the property of probabilistic signature. This paper firstly gives its analysis. Then a threshold signature scheme with the property of probabilistic signature based on the Gap Diffie-Hellman （GDH） group is proposed and its security proof is given in the Random Oracle model. Our construction can prevent the risk of comparison attacks and the security is the same as Boldyreva＇s threshold signature scheme, that is, it can provide the robustness and unforgeability, and it can tolerate t〈n/2 malicious parties. The proposed threshold signature scheme can be regarded as the improvement of Boldyreva＇s constructions.

关 键 词：门限签名 概率签名 双线性对 GDH群 椭圆曲线密码体制 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]