Fully homomorphic encryption based on the ring learning with rounding problem
Authors:
Open Access
- 1 November 2019
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 13 (6) , 639-648
Abstract
Almost all existing well‐known fully homomorphic encryption (FHE) schemes, which are based on either the learning with errors (LWE) or the ring LWE problem, require expensive Gaussian noise sampling. In this study, the authors propose an FHE scheme based on the ring learning with rounding (RLWR) problem. The learning with rounding (LWR) problem was proposed as a deterministic variant of LWE, while the RLWR is a variant of LWR. Sampling an LWR instance does not require Gaussian noise sampling process, and neither does an RLWR instance. Thus, our FHE scheme can be instantiated without the need for Gaussian noise sampling. To implement homomorphic operations, we devise a specific relinearisation method. Furthermore, we also prove that our RLWR‐based FHE scheme is IND‐CPA secure under RLWR assumption.Keywords
This publication has 26 references indexed in Scilit:
- Worst-case to average-case reductions for module latticesDesigns, Codes and Cryptography, 2014
- Lattice Decoding Attacks on Binary LWE2014
- On Ideal Lattices and Learning with Errors over RingsJournal of the ACM, 2013
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- Learning with Rounding, Revisited2013
- Pseudorandom Functions and Lattices2012
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP2012
- On Ideal Lattices and Learning with Errors over Rings2010
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- NTRU: A ring-based public key cryptosystem1998