CryptoDB
Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2006-21829,
title={Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / signcryption;multi-recipient signcryption; bilinear pairings; provable security},
url={http://eprint.iacr.org/2006/338},
note={Wuhan University Journal of Natural Sciences fagenli@mail.xidian.edu.cn 14341 received 7 Oct 2006, last revised 7 Apr 2009},
author={Fagen Li and Yupu Hu and Shuanggen Liu},
year=2006
}