arXiv · 1910.06270
Fully Homomorphic Encryption based on Multivariate Polynomial Evaluation
Abstract
We propose a multi-bit leveled fully homomorphic encryption scheme using multivariate polynomial evaluations. The security of the scheme depends on the hardness of the Learning with Errors (LWE) problem. For homomorphic multiplication, the scheme uses a polynomial based technique that does not require relinearization (and key switching). The noise associated with the ciphertext increases only linearly with every multiplication.
Explore related subjects
Keep this discovery
Uddipana Dowerah, Srinivasan Krishnaswamy. 2019-10-14. Fully Homomorphic Encryption based on Multivariate Polynomial Evaluation. https://arxiv.org/abs/1910.06270
Cite the original work for its findings. Save a collection to share your selection of sources.