CryptoDB
An Efficient and Provably Secure ID-Based Threshold Signcryption Scheme
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Signcryption is a cryptographic primitive that performs digital signature and public key encryption simultaneously, at a lower computational costs and communication overheads than the signature-then-encryption approach. Recently, two identity-based threshold signcryption schemes[12],[26] have been proposed by combining the concepts of identity-based threshold signature and signcryption together. However, the formal models and security proofs for both schemes are not considered. In this paper, we formalize the concept of identity-based threshold signcryption and give a new scheme based on the bilinear pairings. We prove its confidentiality under the Decisional Bilinear Diffie-Hellman assumption and its unforgeability under the Computational Diffie-Hellman assumption in the random oracle model. Our scheme turns out to be more efficient than the two previously proposed schemes. |
BibTeX
@misc{eprint-2008-17864,
title={An Efficient and Provably Secure ID-Based Threshold Signcryption Scheme},
booktitle={IACR Eprint archive},
keywords={public-key cryptography /},
url={http://eprint.iacr.org/2008/187},
note={Full version of a paper that will be published in the 2008 International Conference on Communications, Circuits and Systems (ICCCAS 2008), Xiamen, China, May 25-27, 2008. fagenli@uestc.edu.cn 13995 received 26 Apr 2008},
author={Fagen Li and Yong Yu},
year=2008
}