An efficient elliptic curve based signcryption scheme for firewalls

In this paper, a modified digital signcryption model has been proposed keeping in view the requirements of firewall signcryption. Based on this model, the security and efficiency of existing signcryption schemes that are presented over the years have been analyzed. The analysis shows that these schemes lack certain security attributes and violate the basic principles of firewall signcryption. Furthermore, a new signcryption scheme has been proposed that provides all essential security attributes and complies with all the requirements of firewall signcryption. The proposed scheme also has computational advantages over existing schemes. Since the construction of the proposed scheme is based on elliptic curve cryptography, it is also suitable for resource constrained applications.

[1]  Ramesh Kumar Mohapatra,et al.  Signcryption Schemes With Forward Secrecy Based on Elliptic Curve Cryptography , 2010 .

[2]  Mohsen Toorani,et al.  Cryptanalysis of an Elliptic Curve-based Signcryption Scheme , 2010, Int. J. Netw. Secur..

[3]  Xuanwu Zhou,et al.  Improved Signcryption Scheme with Public Verifiability , 2009, 2009 Pacific-Asia Conference on Knowledge Engineering and Software Engineering.

[4]  Roayat Ismail,et al.  A new efficient publicly verifiable signcryption scheme and its multiple recipients variant for firewalls implementation , 2008, 2009 National Radio Science Conference.

[5]  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.

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

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

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

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

[10]  H. Petersen,et al.  Cryptanalysis and improvement of signcryption schemes , 1998 .

[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.  Signcryption and Its Applications in Efficient Public Key Solutions , 1997, ISW.

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

[14]  Rainer A. Rueppel,et al.  A new signature scheme based on the DSA giving message recovery , 1993, CCS '93.

[15]  C. P. Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.

[16]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[17]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[18]  Hassan M. Elkamchouchi,et al.  Elliptic Curve Signcryption with Encrypted Message Authentication and Forward Secrecy , 2009 .

[19]  Chen Ke-fei,et al.  Cryptanalysis and improvement of signcryption schemes on elliptic curves , 2008, Wuhan University Journal of Natural Sciences.

[20]  Claus-Peter Schnorr,et al.  Efficient signature generation by smart cards , 2004, Journal of Cryptology.

[21]  Rainer A. Rueppel,et al.  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1996, Des. Codes Cryptogr..

[22]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .