Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
