Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a groundbreaking approach to overcoming the input-length barrier in indistinguishability obfuscation (iO) through this conference talk by Zhengzhong Jin from Northeastern University. Learn how mathematical proofs of functional equivalence can revolutionize obfuscation techniques, moving beyond the exponential security reduction losses that have plagued all known general-purpose iO constructions. Discover the innovative framework that enables obfuscation of Turing machines with unbounded length inputs by leveraging short mathematical proofs rather than brute-force input-by-input verification methods. Understand the development of a novel gate-by-gate obfuscation template that preserves circuit topology and examine how these techniques extend to other cryptographic applications including SNARGs (Succinct Non-Interactive Arguments). Gain insights into the theoretical foundations of Cook's Theory PV and its role in proving functional equivalence of circuits and Turing machines, while exploring the broader implications for functional encryption and advanced proof systems in modern cryptography.
