REVIEW 1 cited by
A Somewhat Homomorphic Encryption Scheme based on Multivariate Polynomial Evaluation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 1 Pith paper
-
Policy-Driven AI in Dataspaces: Taxonomy, Explainability, and Pathways for Compliant Innovation
The paper is a literature review that classifies privacy-preserving AI techniques in dataspaces using a qualitative taxonomy of privacy, performance, and compliance ratings.
Discussion (0). Sign in to comment.