Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore a novel approach to general-purpose program obfuscation through local mixing techniques in this conference talk by Ran Canetti from Boston University at the Simons Institute. Discover how simple, local, functionality-preserving random perturbations in circuit structures can potentially achieve obfuscation for all circuits using the additional structure of reversible circuits without requiring additional algebraic structure. Learn about an approach rooted in statistical mechanics that locally "thermalizes" circuits while preserving functionality, and examine the two-step security analysis covering obfuscation of random circuits of bounded length and construction of fully-fledged obfuscators for unbounded length circuits. Understand the specific candidate obfuscators that are simple and relatively efficient, where an obfuscated n-wire, m-gate reversible circuit with security parameter κ contains n wires and poly(n,κ)*m gates, and consider how this alternative path to program obfuscation could impact cryptography in general through joint research with Claudio Chamon, Eduardo R. Mucciolo, and Andrei E. Ruckenstein.