InfoCoBuild

6.5630 Advanced Topics in Cryptography

6.5630 Advanced Topics in Cryptography (Fall 2023, MIT OCW). Instructor: Prof. Yael Tauman Kalai. This course is about the evolution of proofs in computer science. We will learn about the power of interactive proofs, multi-prover interactive proofs, and probabilistically checkable proofs. We will then show how to use cryptography to convert these powerful proof systems into computationally sound non-interactive arguments (SNARGs). (from ocw.mit.edu)

Lecture 05A - The Kilian-Micali Protocol, Part 1

This lecture discusses how to use collision-resistant hash (CRH) functions with local openings and PCP to construct interactive arguments.


Go to the Course Home or watch other lectures:

Lecture 01A - Interactive Proofs and the Sum-Check Protocol, Part 1
Lecture 01B - Interactive Proofs and the Sum-Check Protocol, Part 2
Lecture 02A - Doubly Efficient Interactive Proofs, Part 1
Lecture 02B - Doubly Efficient Interactive Proofs, Part 2
Lecture 03 - Continuation of the GKR Protocol and Corollaries
Lecture 04A - PCP via GKR and Interactive Arguments, Part 1
Lecture 04B - PCP via GKR and Interactive Arguments, Part 2
Lecture 05A - The Kilian-Micali Protocol, Part 1
Lecture 05B - The Kilian-Micali Protocol, Part 2
Lecture 06A - Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1
Lecture 06B - Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 2
Lecture 07A - Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1
Lecture 07B - Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 2
Lecture 08A - Succinct Non-interactive Arguments for Batch NP (BARGs) from LWE, Part 1
Lecture 08B - Succinct Non-interactive Arguments for Batch NP (BARGs) from LWE, Part 2
Lecture 09A - BARGs Implies SNARGs and Connection to Non-signaling PCPs, Part 1
Lecture 09B - BARGs Implies SNARGs and Connection to Non-signaling PCPs, Part 2