Efficient identity based signcryption scheme with public verifiability and forward security
Lei Fei-yu, Chen Wen, Chen Ke-fei, Changshe Ma
Abstract
Lei Fei-yu, Chen Wen, Chen Ke-fei, Changshe Ma
Abstract
In this paper, we point out that Libert and Quisquater's signcryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some-what more efficient than Libert and Quisquater's one.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we point out that Libert and Quisquater's signcryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some-what more efficient than Libert and Quisquater's one.
Key concepts: Signcryption, Bilinear interpolation, Scheme (mathematics), Quadratic residue, Identity (music), Quadratic equation, Computer science, Mathematics