Succinct Obfuscation via Propositional Proofs (or: How to use pv-IO)
summary
Constructs a notion of fully succinct pv-IO that makes an obfuscation size depend only on the secret part of a program, not the public description or input length, and shows how to bootstrap this to full IO assuming PV-correct witness encryption (and standard primitives like LWE). Key tools are pv-IO as a black box, witness encryption, and a somewhere-statistically-binding hash plus succinct garbling; corollaries include rate‑1 IO for many programs, shorter obfuscations (<2× size for some classes), and succinct computational secret sharing.
AI-written summary · about
chapters (8)
- 0:00Succinct obfuscation via pv-IO
- 4:16Why pv-IO matters
- 17:02Succinct IO from pv-IO
- 24:29Fully succinct IO applications
- 32:57Secret sharing with succinct pv-IO
- 37:11Equivalence: succinct pv-IO and SNARGs
- 38:43Rate-1 IO and padding
- 41:38Summary and open problems
related talks
52mIndistinguishability Obfuscation via Mathematical Proofs of Equivalence
01h 12mApplications of Obfuscation I
01h 04mTutorial on obfuscation
01h 15mThe Journey Towards Program Obfuscation
31mObfuscation of Probabilistic Circuits and Applications
31mIndistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic
57mIndistinguishability Obfuscation from Well-Founded Assumptions
01h 08mIncrementally Verifiable Computation for NP from Standard Assumptions