YoVDO

How to Delegate Computations Publicly

Offered By: Simons Institute via YouTube

Tags

Cryptography Courses Computer Science Courses Data Security Courses Probabilistically Checkable Proofs Courses Interactive Proof Systems Courses

Course Description

Overview

Explore the concept of publicly delegating computations in this 28-minute lecture by Lisa Yang from MIT. Delve into probabilistically checkable and interactive proof systems, focusing on publicly verifiable arguments and non-interactive arguments. Learn about local extract ability, protocol overview, and zero testable encryption. Understand how zero tests work and the process of local extraction. Gain insights into previous work in the field and discover the potential applications of these cryptographic techniques in secure and verifiable computation delegation.

Syllabus

Intro
Publicly verifiable arguments
Previous work
NonInteractive Argument
Overview
Local Extract Ability
Protocol Overview
Zero Testable Encryption
Zero Test Works
Local Extract
Summary


Taught by

Simons Institute

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera