Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems
Ford Professor of Engineering & Turing Laureate, MIT
1:03:26·2018·undergraduate level·Public Colloquium
Traces how randomness and interaction transformed mathematical proof from static deduction into probabilistic, zero-knowledge cryptographic verification.
Berkeley ACM A.M. Turing Laureate Lecture
Wednesday, Oct. 3, 2018
Banatao Auditorium, Sutardja Dai Hall
UC Berkeley
Seminar notes & discussion
No public seminar notes on this lecture yet.