Leveled Certificateless Fully Homomorphic Encryption Schemes From Learning With Errors

• Published in: IEEE access Vol. 8; pp. 26749 - 26763
• Main Author: Li, Mingxiang
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptation models; Approximation; Certificateless fully homomorphic encryption; Eigenvectors; Encryption; Lattices; Learning; learning with errors; Multiplication; Public key; random oracle model; Security; Semantics; standard model; Zinc
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2020.2971342

Fully homomorphic encryption (FHE) is a form of public-key encryption that allows the computation of arbitrary functions on encrypted data without decrypting the data. As a result, it is a useful tool with numerous applications. Certificateless encryption (CLE) is a type of public-key encryption that combines the advantages of PKI-based public-key encryption with those of identity-based encryption (IBE). Thus, certificateless fully homomorphic encryption (CLFHE) has aroused considerable research interest. Recently, Chen, Hu, and Lian proposed a leveled certificateless homomorphic encryption (CLHE) scheme and proved its semantic security based on the learning with errors (LWE) problem in the random oracle model. However, their scheme supports only homomorphic addition, but not homomorphic multiplication. In this work, we construct two leveled CLFHE schemes using the approximate eigenvector method presented by Gentry, Sahai, and Waters. Based on the hardness of the LWE problem, we prove that one scheme satisfies adaptive semantic security and anonymity in the random oracle model, whereas the other satisfies selective semantic security and anonymity in the standard model.