Cryptology ePrint Archive: Report 2006/338

Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings

Fagen Li, Yupu Hu, and Shuanggen Liu

Abstract: Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at a 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.

Category / Keywords: public-key cryptography / signcryption;multi-recipient signcryption; bilinear pairings; provable security

Publication Info: Wuhan University Journal of Natural Sciences

Date: received 7 Oct 2006, last revised 7 Apr 2009

Contact author: fagenli at mail xidian edu cn

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20090407:080514 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]