Lattice-based certificateless public-key encryption in the standard model |
| |
Authors: | Reza Sepahi Ron Steinfeld Josef Pieprzyk |
| |
Affiliation: | 1. Computing Department, Faculty of Science, Macquarie University, Sydney, NSW, Australia
|
| |
Abstract: | The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|