YoVDO

Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits

Offered By: IEEE via YouTube

Tags

IEEE Symposium on Security and Privacy Courses Cryptography Courses Privacy Courses Arithmetic Circuits Courses Data Security Courses Boolean Circuits Courses Zero-Knowledge Proofs Courses

Course Description

Overview

Explore a cutting-edge presentation on Wolverine, a system for generating fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. Delve into the fundamentals of knowledge proofs, their applications, and existing proof systems. Examine the tradeoffs in current approaches and gain insights into the intuition behind Wolverine. Learn about SVLE preprocessing, verification techniques, and the innovative Cotton Bucketing method. Understand the proof protocol for both Boolean and arithmetic circuits, and discover the latest follow-up work in this rapidly evolving field of cryptography and computer science.

Syllabus

Introduction
What is Knowledge Proof
Applications
Existing Proof Systems
Tradeoffs
Intuition
SVLE
Preprocessing
Verification
Cotton Bucketing
Proof Protocol
Boolean
Arithmetic
Followup work


Taught by

IEEE Symposium on Security and Privacy

Tags

Related Courses

Algebra & Algorithms
Moscow Institute of Physics and Technology via Coursera Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Institute for Advanced Study via YouTube Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Undergrad Complexity at CMU - SAT
Ryan O'Donnell via YouTube Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Association for Computing Machinery (ACM) via YouTube