Abstract
Many identity-based digital signature schemes are proved secure in the random oracle model. However, the application of the random oracle may lead to security risks. The used hash function is specific and the response result of the query is not always random, hence it may cause the insecurity of the scheme. To solve the above issues, this paper presents an efficient identity-based signature scheme which is proved secure under the standard model. The security of the proposed scheme is reduced to the well-known computational Diffie–Hellman (CDH) assumption. Furthermore, compared with the related identity-based signature schemes, the scheme proposed in this paper has great advantages in the computation cost of signing and verification.
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.
