Fully Homomorphic Encryption based on Multivariate Polynomial Evaluation
This work addresses the challenge of efficient homomorphic multiplication in cryptography, but it appears incremental as it builds on existing LWE-based methods without a clear breakthrough.
The authors tackled the problem of fully homomorphic encryption by proposing a scheme based on multivariate polynomial evaluation, which eliminates the need for relinearization and key switching, resulting in noise that increases only linearly with each multiplication.
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.