Explore a groundbreaking talk from Crypto 2013 on SNARKs for C, focusing on verifying program executions succinctly. Delve into the innovative work of Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza as they present preprocessing zero-knowledge SNARKs (succinct non-interactive arguments of knowledge). Gain insights into the high-level view of their system, including the TinyRAM architecture for fast verification. Examine the performance aspects of TinyRAM, including code size and the transition from asymptotic to concrete efficiency. Learn about prior implementation work that handles various special cases more efficiently, and discover how these concepts apply to problems like the Traveling Salesman Problem.
SNARKs for C - Verifying Program Executions Succinctly and in Zero Knowledge
Overview
Syllabus
Intro
preprocessing zero-knowledge SNARKS (succinct non-interactive arguments of knowledge)
High-Level View of Our System
TinyRAM architecture for fast verification
Performance of TinyRAM Code size (number of instructions output by compiler)
From Asymptotic To Concrete Efficiency
Prior Implementation Work Handles various special cases, more efficiently.
Traveling Salesman Problem
Taught by
TheIACR
