Rhapsody in Zero Knowledge - Proving Without Revealing
Offered By: Strange Loop Conference via YouTube
Course Description
Overview
Explore the fascinating world of zero knowledge proofs in this 38-minute conference talk from Strange Loop. Delve into the concept of proving something without revealing the underlying information, a powerful idea with far-reaching implications for privacy and security. Learn how this decades-old solution addresses modern challenges in machine learning and fraud detection without compromising personal data. Discover the potential of constraints, complexity, and universal verifiable computation in creating secure systems that don't sacrifice privacy. Follow along as the speaker, Tony Arcieri, guides you through topics such as probabilistic encryption, interactive and non-interactive proof systems, ZCash, recursive proofs, Bullet and range proofs, ZK Starks, and ZK C. No prior knowledge of cryptography or proof systems is required to grasp these groundbreaking concepts that could reshape our approach to data security and privacy.
Syllabus
Introduction
Probabilistic Encryption
Interactive Proof Systems
NonInteractive Proof Systems
CRS
Zcash
A recursive proof
Bullet and range proofs
ZK Starks
ZK C
Questions
Taught by
Strange Loop Conference
Tags
Related Courses
Fully Linear PCPs and Their Cryptographic ApplicationsSimons Institute via YouTube How to Do Fiat-Shamir in the Standard Model
Simons Institute via YouTube How to Delegate Computations Publicly
Simons Institute via YouTube Transparent SNARKs from DARK Compilers
Simons Institute via YouTube On Prover-Efficient Public-Coin Emulation of Interactive Proofs
Paul G. Allen School via YouTube