You are looking at a specific version 20090407:080514 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Wuhan University Journal of Natural Sciences
Keywords
signcryptionmulti-recipient signcryptionbilinear pairingsprovable security
Contact author(s)
fagenli @ mail xidian edu cn
History
2009-04-07: revised
2006-10-20: received
See all versions
Short URL
https://ia.cr/2006/338
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.