Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (33): 73-74.DOI: 10.3778/j.issn.1002-8331.2009.33.023
• 网络、通信、安全 • Previous Articles Next Articles
GAO Dong-mei,ZHANG Long,LIU Shao-wu
Received:
Revised:
Online:
Published:
Contact:
高冬梅,张 龙,刘绍武
通讯作者:
Abstract: This paper proposes a threshold blind signature scheme,called pairing-based threshold blind signature scheme.The proposed scheme is constructed on Weil 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.
Key words: threshold signature, blind signature, Weil pairing, bilinear Diffie-Hellman assumption
摘要: 提出了一种新型的门限盲签名方案,称为基于双线性映射的门限盲签名方案。该方案使用椭圆曲线上的Weil对和Shamir的秘密分享方法来构造,并分析了新方案的正确性和安全性,分析结果表明,在双线性Diffie-Hellman难题下,参与者能方便地产生个体盲签名,公开验证者可通过验证公式决定是否接受发送方计算出的门限盲签名。而任何攻击者不能伪造个体盲签名,即使已知所有参与者的秘密值也无法伪造门限盲签名。
关键词: 门限签名, 盲签名, Weil对, 双线性Diffie-Hellman假设
CLC Number:
TP309
GAO Dong-mei,ZHANG Long,LIU Shao-wu. Threshold blind signature scheme based on bilinear pairings[J]. Computer Engineering and Applications, 2009, 45(33): 73-74.
高冬梅,张 龙,刘绍武. 一种门限的双线性基盲签名方案[J]. 计算机工程与应用, 2009, 45(33): 73-74.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.33.023
http://cea.ceaj.org/EN/Y2009/V45/I33/73