Efficient Online/Offline Signcryption Scheme

Abstract In this paper, we propose a new signcryption scheme and its online/offline version from pairings. Based on the assumption of k’1 square roots, the scheme is proven, without random oracles, to be secure against the existential forgery under an adaptive chosen-message attack. It is also proven that its IND-CPA security also implies its IND-CCA2 security. A comparison is made with existing schemes from the viewpoint of computational cost and the size of ciphertexts.

[1]  Hugo Krawczyk,et al.  The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?) , 2001, CRYPTO.

[2]  Yael Tauman Kalai,et al.  Improved Online/Offline Signature Schemes , 2001, CRYPTO.

[3]  Jean-Jacques Quisquater,et al.  Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups , 2004, Public Key Cryptography.

[4]  Yi Mu,et al.  Efficient Signcryption Without Random Oracles , 2006, ATC.

[5]  Xavier Boyen,et al.  Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography) , 2003, CRYPTO.

[6]  Mihir Bellare,et al.  Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography , 2000, ASIACRYPT.

[7]  Mohamed Al-Ibrahim.  A Signcryption Scheme Based on Secret Sharing Technique , 2003, MMM-ACNS.

[8]  Joonsang Baek,et al.  Formal Proofs for the Security of Signcryption , 2002, Public Key Cryptography.

[9]  Yi Mu,et al.  A New Signature Scheme Without Random Oracles from Bilinear Pairings , 2006, VIETCRYPT.

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

[11]  Silvio Micali,et al.  On-Line/Off-Line Digital Schemes , 1989, CRYPTO.

[12]  Chanathip Namprempre,et al.  Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm , 2000, ASIACRYPT.

[13]  Jean-Jacques Quisquater,et al.  A new identity based signcryption scheme from pairings , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[14]  Dong Hoon Lee,et al.  Provably Secure Encrypt-then-Sign Composition in Hybrid Signcryption , 2002, ICISC.

[15]  Jean-Jacques Quisquater,et al.  Improved Signcryption from q-Diffie-Hellman Problems , 2004, SCN.

[16]  Liqun Chen,et al.  Improved Identity-Based Signcryption , 2005, Public Key Cryptography.

[17]  Paulo S. L. M. Barreto,et al.  Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps , 2005, ASIACRYPT.

[18]  Tal Rabin,et al.  On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.