An efficient signcryption scheme based on ECC with forward secrecy and encrypted message authentication

In this paper, an efficient signcryption scheme based on elliptic curve cryptosystem is going to be proposed which can effectively combine the functionalities of digital signature and encryption and also takes a comparable amount of computational cost and communication overhead. The proposed scheme provides confidentiality, integrity, unforgeability and nonrepudiation, along with encrypted message authentication, forward secrecy of message confidentiality and public verification. By forward secrecy of message confidentiality function we mean, although the private key of the sender is divulged inattentively, it does not affect the confidentiality of the previously stored messages. By the public verification function we mean, any third party can verify directly the signature of the sender of the original message without the sender's private key when dispute occurs. It enhances the justice of judge. In addition, proposed scheme will save great amount of computational cost. The proposed scheme can be applied to the lower computational power devices, like smart card based applications, e-voting and many more, due to their lower computational cost. The Proposed Scheme is discussed in this paper and is compared with the existing schemes with respect to computational cost and the security functions it provides.

[1]  Yupu Hu,et al.  Signcryption based on elliptic curve and its multi-party schemes , 2004, InfoSecu '04.

[2]  Mohsen Toorani,et al.  Cryptanalysis of an efficient signcryption scheme with forward secrecy based on elliptic curve , 2008, 2008 International Conference on Computer and Electrical Engineering.

[3]  Scott A. Vanstone,et al.  Elliptic curve cryptosystem - The answer to strong, fast public-key cryptography for securing constrained environments , 1997, Inf. Secur. Tech. Rep..

[4]  Vincent Rijmen,et al.  Cryptography on smart cards , 2001, Comput. Networks.

[5]  Ren-Junn Hwang,et al.  An efficient signcryption scheme with forward secrecy based on elliptic curve , 2005, Appl. Math. Comput..

[6]  Yuliang Zheng,et al.  Encrypted Message Authentication by Firewalls , 1999, Public Key Cryptography.

[7]  Mohsen Toorani,et al.  An Elliptic Curve-based Signcryption Scheme with Forward Secrecy , 2009, ArXiv.

[8]  Hideki Imai,et al.  How to Construct Efficient Signcryption Schemes on Elliptic Curves , 1998, Inf. Process. Lett..

[9]  Joonsang Baek,et al.  Formal Proofs for the Security of Signcryption , 2002, Journal of Cryptology.

[10]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[11]  Robert H. Deng,et al.  A Signcryption Scheme with Signature Directly Verifiable by Public Key , 1998, Public Key Cryptography.

[12]  Yuliang Zheng,et al.  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.