Doubly Efficient Interactive Proofs in Advanced Cryptography - Lecture 2
MIT OpenCourseWare via YouTube
Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
Get 20% off all career paths from fullstack to AI
Overview
Build a Learning Habit
Download Class Central's free printable study calendar
Download for Free
Explore advanced cryptography concepts in this MIT lecture focusing on doubly efficient interactive proofs, where Professor Yael T. Kalai delves into counting triangles in graphs, low-degree extension, and the GKR protocol for bounded depth computations. Learn through detailed examples and theoretical frameworks that demonstrate how doubly efficient IP operates across various computational scenarios. Master fundamental principles of interactive proof systems while understanding their practical applications in cryptographic protocols and computational verification methods.
Syllabus
Lecture 2: Doubly Efficient Interactive Proofs, Part 1
Taught by
MIT OpenCourseWare