[Resource Topic] 2006/338: Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings

Welcome to the resource topic for 2006/338

Title:
Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings

Authors: Fagen Li, Yupu Hu, 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.

ePrint: https://eprint.iacr.org/2006/338

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .