Efficient and provably secure multi-recipient signcryption from bilinear pairings

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings, which broadcasts a message to multiple users in a secure and authenticated manner. We prove its semantic security and unforgeability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads.

[1]  Xiang Li,et al.  An Identity-Based Threshold Signcryption Scheme with Semantic Security , 2005, CIS.

[2]  Zhenfu Cao,et al.  Efficient ID-Based Proxy Signature and Proxy Signcryption Form Bilinear Pairings , 2005, CIS.

[3]  John Malone-Lee,et al.  Identity-Based Signcryption , 2002, IACR Cryptol. ePrint Arch..

[4]  Lu Rong-xing.  Robust ID-Based Threshold Signcryption Scheme from Pairings , 2005 .

[5]  Yi Mu,et al.  Identity-based ring signcryption schemes: cryptographic primitives for preserving privacy and authenticity in the ubiquitous world , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[6]  Xiaotie Deng,et al.  Analysis and Improvement of a Signcryption Scheme with Key Privacy , 2005, ISC.

[7]  Kefei Chen,et al.  Efficient and Proactive Threshold Signcryption , 2005, ISC.

[8]  Kwangjo Kim,et al.  Electronic Funds Transfer Protocol Using Domain-Verifiable Signcryption Scheme , 1999, ICISC.

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

[10]  Tsz Hon Yuen,et al.  Fast and Proven Secure Blind Identity-Based Signcryption from Pairings , 2005, CT-RSA.

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

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

[13]  Antoine Joux,et al.  Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups , 2001, IACR Cryptology ePrint Archive.

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

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

[16]  Yuan Zhou,et al.  Secure Delegation-by-Warrant ID-Based Proxy Signcryption Scheme , 2005, CIS.

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

[18]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[19]  Siu-Ming Yiu,et al.  Efficient Forward and Provably Secure ID-Based Signcryption Scheme with Public Verifiability and Public Ciphertext Authenticity , 2003, ICISC.

[20]  Yuliang Zheng,et al.  Signcryption and Its Applications in Efficient Public Key Solutions , 1997, ISW.

[21]  Li Fagen,et al.  Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings , 2007 .

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

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

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

[25]  Kefei Chen,et al.  Identity based proxy-signcryption scheme from pairings , 2004, IEEE International Conference onServices Computing, 2004. (SCC 2004). Proceedings. 2004.