INTERPOL: Information Theoretically Verifiable Polynomial Evaluation
INTERPOL: Information Theoretically Verifiable Polynomial Evaluation
We study the problem of verifiable polynomial evaluation in the user-server and multi-party setups. We propose INTERPOL, an information-theoretically verifiable algorithm that allows a user to delegate the evaluation of a polynomial to a server, and verify the correctness of the results with high probability and in sublinear complexity. Compared …