Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practical identity based signcryption schemes without bilinear pairing are considered to be almost impossible, it will be interesting to explore possibilities of constructing such systems in other settings like certificateless cryptography. Often for practical systems, bilinear pairings are considered to induce computational overhead. Signcryption is a powerful primitive that offers both confidentiality and authenticity to noteworthy messages. Though some prior attempts were made for designing certificateless signcryption schemes, almost all the known ones have security weaknesses. Specifically, in this paper we demonstrate the security weakness of the schemes in ,  and . We also present the first provably secure certificateless signcryption scheme without bilinear pairing and prove it in the random oracle model.
KeywordsCertificateless Signcryption Provable Security Pairing-free Cryptosystem Random Oracle model Cryptanalysis
Unable to display preview. Download preview PDF.
- 1.Aranha, D., Castro, R., Lopez, J., Dahab, R.: Efficient certificateless signcryption, http://sbseg2008.inf.ufrgs.br/proceedings/data/pdf/st03_01_resumo.pdf
- 3.Barreto, P.S.L.M., Deusajute, A.M., de Souza Cruz, E., Pereira, G.C.F., da Silva, R.R.: Toward efficient certificateless signcryption from (and without) bilinear pairings, http://sbseg2008.inf.ufrgs.br/proceedings/data/pdf/st03_03_artigo.pdf
- 4.Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptographic protocols: A survey (2004), Cryptology ePrint Archive, Report 2004/064, http://eprint.iacr.org/
- 6.Wu, C., Chen, Z.: A new efficient certificateless signcryption scheme. In: IEEE, International Symposium on Information Science and Engieering, ISISE 2008, vol. 1, pp. 661–664 (2008)Google Scholar