Identity-based blind signature scheme based on BLS signatures
Banghai Xu · Journal of Computer Applications · 2008
Depending on BLS signing algorithm,blind signing algorithm of BLS signatures,and aggregating algorithm of BLS signatures,a new efficient identity-based blind signature scheme was proposed.First,the round complexity of this scheme was optimal,i.e.it was enough for the user and the signer to respectively transmit only one message during each blind signing process.Second,its security was based on the so-called one-more Computational Diffie-Hellman Assumption(CDH) assumption,while the security of the other similar identity-based signature scheme was based on the stronger assumption-ROS assumption.Additionally,this scheme was computationally efficient and had very short signature length.Therefore, it was very suitable for the applications such as e-cash and e-voting.