# A Somewhat Homomorphic Encryption Scheme based on Multivariate Polynomial Evaluation

arXiv: https://arxiv.org/abs/1902.05771 · HTML: https://mlsanity.com/paper/1902.05771/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Feb 2019.

## Built on by (most cited first, 1 of 1)

- [Policy-Driven AI in Dataspaces: Taxonomy, Explainability, and Pathways for Compliant Innovation](https://mlsanity.com/paper/2507.20014/) (2025)

## Abstract (arXiv)

We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a generalization of the Learning with Errors problem called the Hidden Subspace Membership problem and show that the semantic security of the proposed scheme can be reduced to the hardness of this problem.