~/talk

Tutorial on Proof Systems

slides:none on file

Survey of recent work on making non‑interactive succinct proofs practical: shows how PCP+Kilian-style compilers and the Fiat‑Shamir heuristic are turned into SNARGs by building correlation‑intractable hash families, introduces Batch‑NP and a somewhere statistical soundness notion that hides one statistically binding index in the CRS, and explains folding/recursion to compress T instances to polylog verification. Covers iO/Sahai‑Waters routes around the Gentry‑Wichs barrier and the Waters‑Wu bilinear exception; constructions work but current CRS and cryptographic tools remain large.

AI-written summary · about

  1. 0:00Welcome and logistics
  2. 2:08Workshop introduction
  3. 3:14Cryptographic proofs overview
  4. 6:46Zero knowledge and connections
  5. 10:41SNARKs and standard assumptions
  6. 14:09The recipe for SNARKs
  7. 23:04Batch NP and statistical soundness
  8. 32:17Completeness for P
  9. 39:18Interactive proofs and folding
  10. 52:34Efficiency and alternative methods
  11. 55:45SNARKs for NP and open problems
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.