An Efficient Tripartite Signcryption Scheme Without Bilinear Pairings
Hassan M. A. Elkamchouchi, Eman Abou Elkheir, Yasmine Abouelseoud · 2013
Authentication and confidentiality are the most important security goals to be achieved. This paper proposes a new tripartite signcryption scheme without bilinear pairings. The proposed tripartite signcryption scheme is efficient when three entities want to perform secure transactions as in mobile communication or in e-commerce. The proposed scheme is based on the elliptic curve discrete logarithm problem (ECDLP) and achieves the seven security requirements; confidentiality, unforgeability, public verifiability, non-repudiation, integrity, authentication, and forward secrecy. Also, the proposed scheme supports public verifiability without using any short or long term keys. The performance of the proposed scheme is examined.