~/talk

An Introduction to Commitment-Based Succinct Arguments

slides:none on file

Explains a concrete recipe: short arguments come from combining an information‑theoretic probabilistic proof (PCP/IOP) with a cryptographic commitment so that many SNARGs are special cases of Kilian's protocol using a vector commitment or its functional/batched variants; gives two security analyses (rewinding tradeoff, 1/ε vs runtime, and straight‑line extraction in an ideal model), shows how multi‑round IOPs and batch openings compress efficiently, and pinpoints when Fiat‑Shamir works in the random‑oracle case versus standard‑model obstacles; points to snargsbook.org.

AI-written summary · about

  1. 0:00Workshop introduction
  2. 3:12Program on proof systems
  3. 4:13Commitment-based succinct arguments
  4. 19:00Kilian's Protocol security
  5. 35:52Query models in succinct arguments
  6. 46:12Multi-round oracle proofs
  7. 54:59Public vs private coin IOPs
  8. 1:00:44Fiat-Shamir transformation
  9. 1:06:08Talk summary
~/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.