Abstract
Certificateless Public Key Cryptography was first introduced by Al-Riyami and Paterson in order to eliminate the inherent key-escrow problem of Identity-Based Cryptography. In this paper, we present a new practical construction of certificateless public key encryption scheme without paring. Our scheme is, in the random oracle model, provably secure under the assumption that the RSA problem is intractable. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Lai, J., Deng, R. H., Liu, S., & Kou, W. (2009). RSA-based certificateless public key encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5451 LNCS, pp. 24–34). https://doi.org/10.1007/978-3-642-00843-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
