YoVDO

Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Cryptography Courses Boolean Circuits Courses Non-Interactive Zero-Knowledge Proofs Courses

Course Description

Overview

Explore the latest advancements in non-interactive zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits in this 23-minute conference talk. Delve into the "MPC-in-the-head" paradigm and its application with MPC protocols in the preprocessing model. Examine recent works like ZKBoo, ZKB++, and Ligero, and discover how they contribute to efficient NIZKPoKs based solely on symmetric-key primitives. Learn about the new approach involving OT channels, preprocessing, and a two-stage protocol. Understand the implications for zero-knowledge, communication efficiency, and proof size. Gain insights into the potential applications for post-quantum signatures and the overall end results of this research.

Syllabus

Overview
NonInteractive Zero Knowledge
Previous Work
New Approach
NPC in the Head
OT Channels
Preprocessing
TwoStage Protocol
Zero Knowledge
Communication Efficiency
NonInteractive Protocol
Proof Size
End Result
PostQuantum Signatures


Taught by

Association for Computing Machinery (ACM)

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
Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
IEEE via YouTube