A practical identity based signcryption scheme from bilinear pairing
Arijit Karati, G. P. Biswas · 2016
Signcryption is one of the most recent public key paradigms that fulfills both the requirement of confidentiality and authenticity of messages between parties. It works more efficiently with a cost significantly smaller than that required by signature-then-encryption technique. In this work, a practically implementable ID-based sigcryption scheme using the bilinear pairings is presented. The proposed scheme is implemented under the hardness of CDH (Computational Diffie-Hellman) assumption in standard model without random oracle model. Performance evaluation of the scheme shows satisfactory result after comparing with other relevant ID-based signcryption schemes. Thus, our scheme should be implemented in real life scenario where both the confidentiality and authenticity is required with low computational cost.