Cryptology ePrint Archive: Report 2008/187

An Efficient and Provably Secure ID-Based Threshold Signcryption Scheme

Fagen Li and Yong Yu

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.

Category / Keywords: public-key cryptography /

Publication Info: 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.

Date: received 26 Apr 2008

Contact author: fagenli at uestc edu cn

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

Version: 20080429:152504 (All versions of this report)

Discussion forum: Show discussion | Start new discussion