Doubly Efficient Interactive Proofs in Advanced Cryptography - Lecture 2
MIT OpenCourseWare via YouTube
Google, IBM & Microsoft Certificates — All in One Plan
Foundations of Data Visualization - Self Paced Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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