BARGs Implies SNARGs and Connection to Non-Signaling PCPs - Lecture 9
MIT OpenCourseWare via YouTube
AI Engineer - Learn how to integrate AI into software applications
AI, Data Science & Cloud Certificates from Google, IBM & Meta
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 a graduate-level cryptography lecture from MIT's Advanced Topics in Cryptography course that delves into the relationship between Batch Arguments (BARGs) and Succinct Non-interactive Arguments (SNARGs), while establishing their connection to non-signaling Probabilistically Checkable Proofs (PCPs). Led by Professor Yael T. Kalai, learn advanced theoretical concepts in cryptographic proof systems over this 87-minute session that forms part of a comprehensive exploration of modern cryptographic techniques and their mathematical foundations.
Syllabus
Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 1
Taught by
MIT OpenCourseWare