一种门限的双线性基盲签名方案

Threshold blind signature scheme based on bilinear pairings

提出了一种新型的门限盲签名方案,称为基于双线性映射的门限盲签名方案。该方案使用椭圆曲线上的Weil对和Shamir的秘密分享方法来构造,并分析了新方案的正确性和安全性,分析结果表明,在双线性Diffie-Hellman难题下,参与者能方便地产生个体盲签名,公开验证者可通过验证公式决定是否接受发送方计算出的门限盲签名。而任何攻击者不能伪造个体盲签名,即使已知所有参与者的秘密值也无法伪造门限盲签名。

This paper proposes a threshold blind signature scheme,called pairing-based threshold blind signature scheme.The proposed scheme is constructed on Well pairing on elliptic curves and the Shamir＇s secret sharing scheme,and the validity and the security of the scheme are analysed as well.A partial blind signature can be expediently generated by participants under the bilinear Diffie-Hellman assumption ,and any public verifier can check the validity of partial signature and threshold blind signatures.However,any attacker cannot forge partial signature.Given the knowledge of all the participants＇ secret values,a threshold blind signature cannot be forged.