YoVDO

Transparent SNARKs from DARK Compilers

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Compilers Courses Zero-Knowledge Proofs Courses

Course Description

Overview

Explore a 25-minute conference talk presented at Eurocrypt 2020 on Transparent SNARKs from DARK Compilers. Delve into the paper by Benedikt Bünz, Ben Fisch, and Alan Szepieniec, which covers general-purpose zero-knowledge proofs, compilation pipelines, and polynomial commitment schemes. Learn about evaluation protocols with special homomorphic commitments, groups of unknown order, and their associated hardness assumptions. Discover the applications of GUOs, integer encoding techniques, and the intricacies of polynomial IOP compilers. Examine the compiled polynomial IOP soundness, Supersonic constructions, and their performance. Gain insights into this cutting-edge cryptographic research and its potential implications for transparent SNARKs.

Syllabus

Intro
General Purpose Zero-Knowledge Proofs
Compilation Pipeline
Contributions
Talk Outline
Polynomial Commitment Scheme
Evaluation Protocol with Special Homomorphic Commitment
Groups of Unknown Order
Hardness Assumptions
What are GUOs good for?
Integer Encoding
Polynomial IOP Compiler
Compiled Polynomial IOP – Soundness
Supersonic / Other Constructions
Supersonic Performance
Conclusions


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity
Cryptography II
Stanford University via Coursera
Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera
Cryptography I
Stanford University via Coursera
Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera