
Doubly Efficient Interactive Proofs in Advanced Cryptography - Lecture 2
MIT OpenCourseWare via YouTube
Overview

FLASH SALE: Ends May 22!
Udemy online courses up to 85% off.
Get Deal
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