  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.
