Главная
Study mode:
on
1
Intro
2
Outsourcing Computation
3
Homomorphic Encryption
4
Verifiable Computation
5
VC with Input Privacy
6
Multi-Server Schemes
7
Our Results
8
High Level Overview
9
Low-Degree Polynomial Interpolation
10
Curve Intersecting Method
11
Surface Translating Method
12
Domain Extending Method
13
Performance Analysis
14
Experimental Results
Description:
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.

Multi-Server Verifiable Computation of Low-Degree Polynomials

IEEE
Add to list