ID-based Weak Blind Signature and ID-based Strong Blind Signature From Bilinear Pairings

摘要

The blind signature scheme is a protocol for obtaining a signature from a signer, but the signer is unable to view the message he signs, it's anonymity can be applied to the field of e-commerce, e-voting and anonymous access control and etc, and it can be classified into weak blind signature and strong blind signature in accordance with the linkage between the final signature and signature of blinded message. By using the bilinear pairings, an ID-based weak blind signature and an ID-based strong blind signature scheme are proposed, which is based on the Discrete Logarithm Problem and Gap Diffie-Hellman Problem. These schemes use ID-based public key instead of public key of digital certification, can effectively simplify the procedure of public key management and reduce the disk storage space. Finally, we analyzed the security of the proposed scheme.