Explore a comprehensive presentation on efficient designated-verifier non-interactive zero-knowledge proofs of knowledge, based on a paper by Pyrros Chaidos and Geoffroy Couteau presented at Eurocrypt 2018. Delve into the intricacies of zero-knowledge proofs, non-interactive zero-knowledge, and the NIZK landscape. Examine the DFN compiler and the [CG15] compiler, and discover the innovative techniques proposed by the authors. Gain insights into why extraction works and understand the key components of the paper. This 24-minute conference talk provides a thorough overview of advanced cryptographic concepts and their practical applications in the field of zero-knowledge proofs.
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
Overview
Syllabus
Intro
Zero-Knowledge Proof
Non-Interactive Zero
The NIZK Landscape
The DFN Compiler
The [CG15] Compiler
Our Technique
Why Extraction Works?
What's in the Paper?
Thank you for your attention
Taught by
TheIACR
Related Courses
-
New Constructions of Statistical NIZKs - Dual-Mode DV-NIZKs and More
-
Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions
-
Compact NIZKs from Standard Assumptions on Bilinear Maps
-
ITC Conference - Line Point Zero Knowledge and Its Applications
-
Non Interactive Zero Knowledge Proofs for Composite Statements
-
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
