INTERPOL: Information Theoretically Verifiable Polynomial Evaluation

28 Apr 2019 Sahraei Saeid Avestimehr A. Salman

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • CRYPTOGRAPHY AND SECURITY
  • INFORMATION THEORY
  • INFORMATION THEORY