基于双线性函数的门限签名方案  

An Pairing-based Threshold Signature

作　　者：晋玉星[1] 刘文化[2] 

机构地区：[1]开封大学,河南开封475000 [2]济源职业技术学院,河南济源454650

出　　处：《航空计算技术》2009年第6期85-87,共3页Aeronautical Computing Technique

基　　金：国家自然科学基金资助项目(60372046)

摘　　要：门限签名是现代电子商务一种重要的数字签名。利用基于椭圆曲线上的双线性对函数,减少了计算量;利用Sham ir秘密共享技术共享一个用户的私钥,而不是共享密钥生成中心的主密钥,提高方案的安全性。利用Gennaro可模拟的思想,证明了提出的方案具有健壮性和不可伪造性,因此是安全的。与传统的方案相比,新方案具有更高的计算效率。Threshold signature scheme is an important digital signature of modern electronic business. In this paper, we adopt the pairings on elliptic curves, in order to reduce caculation, we adopt such a method that the private key associated with an identity rather than the master key is shared ,to improve the security. Using Gennaro＇s idea of simulatablity, we prove that the proposed scheme has the properties of robustness and unforgeability, therefore, the scheme is secure. Compared with the scheme proposed by Cheng et. al. recently,the new scheme is more efficient in computation.

关 键 词：数字签名 双线性对 门限签名 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]