A New ID-Based Signcryption Scheme
Uan Xiu-feng
Abstract
Uan Xiu-feng
Abstract
A new ID-based signcryption scheme is designed by using bilinear pairing on the Elliptic Curve. In this proposed scheme,the message is obtained after its validity being verified by the receiver. In addition,the new scheme is safe in confidentiality,unforgeability,public verifiability,and robustness. Compared with the existing ID-based signcryption schemes,the new scheme is more efficient in computational complexity and communication costs. Thus,the authentication and confidentiality of message is realized effectively.
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.
A new ID-based signcryption scheme is designed by using bilinear pairing on the Elliptic Curve. In this proposed scheme,the message is obtained after its validity being verified by the receiver. In addition,the new scheme is safe in confidentiality,unforgeability,public verifiability,and robustness. Compared with the existing ID-based signcryption schemes,the new scheme is more efficient in computational complexity and communication costs. Thus,the authentication and confidentiality of message is realized effectively.
Key concepts: Signcryption, Computer science, Scheme (mathematics), Robustness (evolution), Confidentiality, Bilinear interpolation, Authentication (law), Elliptic curve