Abstract
Several identity-based signature schemes with message recovery have already been proposed so far, and most of the existing schemes are constructed from the bilinear pairings. Although the bilinear pairings are quite useful in the study of cryptography, it is hard to implement and computationally expensive. In this paper, we describe a novel identity-based signature scheme with message recovery from RSA, which does not need to employ the bilinear pairings. Under the hardness of RSA problem, our scheme satisfies existential unforgeable against adaptive chosen identity and message attacks in the random oracle model. Furthermore, we extend our scheme for partial message recovery, such that it can deal with the messages of arbitrary length.
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.
