Cryptology ePrint Archive: Report 2009/578
Efficient and Provably Secure Certificateless Signcryption from Bilinear Maps
Wenjian Xie and Zhang Zhang
Abstract: Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In 2008, Barbosa and Farshim introduced the notion of certificateless signcryption (CLSC) and proposed the first CLSC scheme , but which requires six pairing operations in the signcrypt and unsigncrypt phases. In this paper, aimed at designing an efficient CLSC scheme, we propose a new efficient CLSC scheme from bilinear maps, which requires only two pairing operations in the signcrypt and unsigncrypt phases and is more efficient than all the schemes available.
Category / Keywords: Certificateless; Signcryption scheme; Bilinear pairing
Date: received 28 Nov 2009, last revised 20 Apr 2010
Contact author: wjxieem at gmail com
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Note: Recently Sharmila Deva Selvi et al. pointed out that our scheme are not secure against Type I adversary . We have to re-formalize a new security model which is a little weaker than the original one. In this model, we assume that the ciphertext from the signcryption oracle is valid under the original public key of the sender.
Version: 20100421:044436 (All versions of this report)
Short URL: ia.cr/2009/578
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]