YoVDO

Interactive Proofs - Part II

Offered By: Simons Institute via YouTube

Tags

Cryptography Courses Distributed Systems Courses Theoretical Computer Science Courses Decentralization Courses

Course Description

Overview

Delve into the second part of a lecture on Interactive Proofs presented by Justin Thaler from Georgetown University at the Simons Institute. Explore key concepts such as the Arithmetician protocol, Sharpset, and doubly efficient interactive proofs. Examine the process of counting triangles and learn about general-purpose interactive proofs, including the Rango protocol. Discuss the limitations of these protocols and gain a comprehensive understanding of various interactive proof systems. This talk, part of the Proofs, Consensus, and Decentralizing Society Boot Camp, builds upon previous knowledge and provides an in-depth analysis of advanced topics in the field of interactive proofs.

Syllabus

Recap
Problem Description
Arithmetician
Summary
Sharpset
doubly efficient
subject protocol
counting triangles
interactive proof
general purpose interactive proofs
Rango
Limitations
Protocols


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