Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871287 | Discrete Applied Mathematics | 2018 | 9 Pages |
Abstract
In order to resolve the key escrow in identity-based scheme and the significant cost of using a PKI system in traditional public key scheme, the notion of certificateless public key cryptography (CL-PKC) was introduced. The first certificateless public key encryption scheme (CL-PKE) was proposed by Al-Riyami and Paterson, and then further schemes were developed. However, most of them are constructed from the bilinear pairing which is a time costing operation. In this paper, we construct an efficient CL-PKE scheme from RSA since RSA is the de facto Internet standard and is widely used in many applications. The security is based on Kilian-Petrank's RSA assumption which is a variant of RSA.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xi-Jun Lin, Lin Sun, Haipeng Qu,