Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Multi-Server Verifiable Computation of Low-Degree Polynomials

IEEE via YouTube

Overview

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.

Syllabus

Intro
Outsourcing Computation
Homomorphic Encryption
Verifiable Computation
VC with Input Privacy
Multi-Server Schemes
Our Results
High Level Overview
Low-Degree Polynomial Interpolation
Curve Intersecting Method
Surface Translating Method
Domain Extending Method
Performance Analysis
Experimental Results

Taught by

IEEE Symposium on Security and Privacy

Reviews

Start your review of Multi-Server Verifiable Computation of Low-Degree Polynomials

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.