How to Delegate Computations Publicly
Offered By: Simons Institute via YouTube
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
Crash Course on Probabilistically Checkable Proofs - PCPSimons Institute via YouTube Crash Course on Probabilistically Checkable Proofs - Introduction
Simons Institute via YouTube Fully Linear PCPs and Their Cryptographic Applications
Simons Institute via YouTube How to Do Fiat-Shamir in the Standard Model
Simons Institute via YouTube Transparent SNARKs from DARK Compilers
Simons Institute via YouTube