Computability, Zero-Knowledge & Differential Privacy →0/6

1. Introduction, Finite Automata, Regular Expressions

Michael Sipser · 1:00:34

2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA

Michael Sipser · 1:03:27

Lecture 1: Introduction to Cryptography by Christof Paar

Christof Paar · 1:17:24

Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems

Silvio Micali · 1:03:26

What Needs to Be Added to Machine Learning? PAC Learning and Reasoning

Leslie G. Valiant · 54:36

Differential Privacy: Fundamentals to Forefront

Cynthia Dwork · 59:33

Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems

Silvio Micali MIT

Ford Professor of Engineering & Turing Laureate, MIT

1:03:26·2018·undergraduate level·Public Colloquium

Path step 4: Revolutionizes mathematical proof through randomized interaction and zero-knowledge secrecy.

Traces how randomness and interaction transformed mathematical proof from static deduction into probabilistic, zero-knowledge cryptographic verification.

Theory & Algos Cryptography turing award

Berkeley ACM A.M. Turing Laureate Lecture

Wednesday, Oct. 3, 2018

Banatao Auditorium, Sutardja Dai Hall

UC Berkeley

Previous · Step 3

Lecture 1: Introduction to Cryptography by Christof Paar

What Needs to Be Added to Machine Learning? PAC Learning and Reasoning

Seminar notes & discussion

Sign in to comment

No public seminar notes on this lecture yet.