Efficient and provably secure certificateless multi-receiver signcryption

59Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography, so as to avoid the key escrow problem inherent in the identity based system and cumbersome certificate management in public key infrastructure. Signcryption achieves confidentiality and authentication simultaneously in an efficient manner. Multi-receiver signcryption demands signcrypting the same message efficiently for a large number of receivers. In this paper, we propose the first efficient certificateless multi-receiver signcryption scheme and prove it secure in the random oracle model. Our scheme does not require pairing to signcrypt a message for any number of receivers. We are considering a more realistic adversarial model and proving the security against insider attacks, which guarantees non-repudiation and forward secrecy. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Selvi, S. S. D., Vivek, S. S., Shukla, D., & Rangan Chandrasekaran, P. (2008). Efficient and provably secure certificateless multi-receiver signcryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5324 LNCS, pp. 52–67). Springer Verlag. https://doi.org/10.1007/978-3-540-88733-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free