Identity-based Fully Homomorphic Encryption from Ring-LWE: Arbitrary Cyclotomics, Tighter Parameters, Efficient Implementations

DOI

10.2991/mmsta-19.2019.30How to use a DOI?

Keywords

fully homomorphic encryption; cyclotomic rings; cloud computing; ring learning with errors

Abstract

Fully homomorphic encryption allows for data to be stored and processed in an encrypted format, which gives the cloud computing provider a way to process data without even knowing what the data is. At present, most identity-based homomorphic encryption schemes from ring learning with errors have focused on the special classes of rings such as power-of-two cyclotomic rings, which significantly limits its application efficiency in cloud computing. To solve this problem, we construct the first identity-based fully homomorphic encryption scheme from ring learning with errors, which has advantage of high efficiency of encryption and decryption. The security of our scheme is equal to hardness of decision ring learning with errors problem in the random oracle model.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Dan Xin
AU  - Linna Yang
AU  - Lina Yan
AU  - Xiaofeng Song
PY  - 2019/12
DA  - 2019/12
TI  - Identity-based Fully Homomorphic Encryption from Ring-LWE: Arbitrary Cyclotomics, Tighter Parameters, Efficient Implementations
BT  - Proceedings of the 2019 2nd International Conference on Mathematics, Modeling and Simulation Technologies and Applications (MMSTA 2019)
PB  - Atlantis Press
SP  - 143
EP  - 147
SN  - 2352-538X
UR  - https://doi.org/10.2991/mmsta-19.2019.30
DO  - 10.2991/mmsta-19.2019.30
ID  - Xin2019/12
ER  -