Cross-university platform portal

UeduGPTs

--

Jupyters

6

Local AI

--

Uedu Code

--

CISOSE26 Local AI Uedu Code UG26

AI Reply Desktop Notifications

Show a desktop notification when the AI TA finishes replying

Chat Message Notifications

Notify me when classmates post messages in the forum

Sound notification

Play an alert sound whenever there is a new notification

More settings

Account settings Data privacy settings Research Informed Consent Form

6.5630

Advanced Topics in Cryptography

Prof. Yael Tauman Kalai | Fall 2023

Data Science, Analytics & Computer Technology Networks and Security Computer Science Engineering Cryptography

Go to original course

CC BY-NC-SA 4.0

Course introduction

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).

Course Information

Source	MIT 開放式課程
Department	Electrical Engineering and Computer Science
Language	English
Number of videos	17

Course videos (17)

Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 1

Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 1

Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 2

Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 2

Lecture 2: Doubly Efficient Interactive Proofs, Part 1

Lecture 2: Doubly Efficient Interactive Proofs, Part 1

Lecture 2: Doubly Efficient Interactive Proofs, Part 2

Lecture 2: Doubly Efficient Interactive Proofs, Part 2

Lecture 3: Continuation of the GKR Protocol and Corollaries

Lecture 3: Continuation of the GKR Protocol and Corollaries

Lecture 4: PCP via GKR and Interactive Arguments, Part 1

Lecture 4: PCP via GKR and Interactive Arguments, Part 1

Lecture 4: PCP via GKR and Interactive Arguments, Part 2

Lecture 4: PCP via GKR and Interactive Arguments, Part 2

Lecture 5: The Kilian-Micali Protocol, Part 1

Lecture 5: The Kilian-Micali Protocol, Part 1

Lecture 5: The Kilian-Micali Protocol, Part 2

Lecture 5: The Kilian-Micali Protocol, Part 2

Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1

Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1

Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 2

Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 2

Lecture 7: Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1

Lecture 7: Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1

Lecture 7: Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 2

Lecture 7: Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 2

Lecture 8: Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 1

Lecture 8: Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 1

Lecture 8: Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 2

Lecture 8: Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 2

Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 1

Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 1

Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 2

Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 2