Paper 2012/144 Original: eprint.iacr.org/2012/144 ↗
Somewhat Practical Fully Homomorphic Encryption
Abstract
In this paper we port Brakerski's fully homomorphic scheme based on the Learning With Errors (LWE) problem to the ring-LWE setting. We introduce two optimised versions of relinearisation that not only result in a smaller relinearisation key, but also faster computations. We provide a detailed, but simple analysis of the various homomorphic operations, such as multiplication, relinearisation and bootstrapping, and derive tight worst case bounds on the noise caused by these operations. The analysis of the bootstrapping step is greatly simplified by using a modulus switching trick. Finally, we derive concrete parameters for which the scheme provides a given level of security and becomes fully homomorphic.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2012-03-22: last updated
- 2012-03-22: published
- Short URL
- https://ia.cr/2012/144
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/144,
author = {Junfeng Fan and Frederik Vercauteren},
title = {Somewhat Practical Fully Homomorphic Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/144},
year = {2012},
url = {https://eprint.iacr.org/2012/144}
}