Abstract
An efficient provably secure identity-based blind signature (IBBS) scheme based on bilinear pairings is proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, our IBBS is unforgeable under adaptive chosen-message and ID attack. Because of avoiding using the inefficient MapToPoint function, our IBBS can offer advantages in runtime over the schemes available. Based on this ID-based blind signature scheme, we describe the first ID-based threshold blind signature (TBS) and show that it has security properties of unforgeability and robustness.
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.
