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

门限签名是现代电子商务一种重要的数字签名。利用基于椭圆曲线上的双线性对函数，减少了计算量；利用Shamir秘密共享技术共享一个用户的私钥，而不是共享密钥生成中心的主密钥，提高方案的安全性。利用Gennaro可模拟的思想，证明了提出的方案具有健壮性和不可伪造性，因此是安全的。与传统的方案相比，新方案具有更高的计算效率。

An Pairing- based Threshold Signature

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.