ID-based(t,n) threshold blind signature scheme
Shunxiang Wu
Abstract
Shunxiang Wu
Abstract
A new ID-based threshold blind signature scheme based on bilinear pairings is proposed using the technique of verifiable secret sharing scheme, the dishonest private key generator can not impersonate any user at any time. The threshold signature and blind signature are implemented effectively to make blind signature more secure and effetive in electric business and cash charge busi- ness. Up to now, it is the first pairing-based cryptography on ID-based threshold blind signature. Analysis shows that the proposed scheme has provable security properties of blindness, unforgeability and robustness. Furthermore, it is more efficient compared with the previous schemes.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A new ID-based threshold blind signature scheme based on bilinear pairings is proposed using the technique of verifiable secret sharing scheme, the dishonest private key generator can not impersonate any user at any time. The threshold signature and blind signature are implemented effectively to make blind signature more secure and effetive in electric business and cash charge busi- ness. Up to now, it is the first pairing-based cryptography on ID-based threshold blind signature. Analysis shows that the proposed scheme has provable security properties of blindness, unforgeability and robustness. Furthermore, it is more efficient compared with the previous schemes.
Key concepts: Computer science, Blind signature, Signature (topology), Public-key cryptography, Secret sharing, Scheme (mathematics), Verifiable secret sharing, Key generation