Multi-Server Verifiable Computation of Low-Degree Polynomials

Multi-Server Verifiable Computation of Low-Degree Polynomials

Explore a 17-minute IEEE conference talk on multi-server verifiable computation of low-degree polynomials. Delve into outsourcing computation, homomorphic encryption, and verifiable computation with input privacy. Examine multi-server schemes and discover the presenters' results, including a high-level overview of their approach. Learn about low-degree polynomial interpolation techniques such as curve intersecting, surface translating, and domain extending methods. Analyze performance and review experimental results presented by Liang Feng Zhang from ShanghaiTech University and Huaxiong Wang from Nanyang Technological University.