Towards general-purpose program obfuscation via local mixing
summary
Proposes turning reversible circuits into obfuscated versions by repeated local mixing: pick constant-size contiguous gate slices, enumerate functionally equivalent replacements, run an inflation stage then a fixed-size knitting stage, and keep the circuit reversible so intermediate state looks random. Claims an n-wire, m-gate circuit obfuscates to n wires and poly(n, κ)·m gates. Security rests on empirical tests plus a new white-box pseudorandomness assumption about random reversible circuits; partial implementations and break challenges exist.
AI-written summary · about
chapters (12)
- 0:00Program obfuscation intro
- 1:03Indistinguishability obfuscation
- 3:21Thermodynamics approach
- 8:26Reversible circuits for obfuscation
- 16:31Two-step obfuscation plan
- 17:34Local mixing process
- 29:32Stationary distribution analysis
- 32:00Hardness assumptions
- 41:48Obfuscation definition
- 45:22Obfuscation for all circuits
- 49:02Future directions
- 58:24Implementation challenges
