Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore advanced techniques for constructing cryptographic objects using indistinguishability obfuscation (iO) in this 59-minute conference talk. Discover how combining iO with complexity-theoretic assumptions beyond P ≠ NP enables the construction of public-key encryption with optimal hardness guarantees and one-way functions with optimal direct product hardness. Learn about the key theme of integrating obfuscation with assumptions such as the co-non-deterministic hardness of SAT. Examine results of interest to complexity theory, including a reduction from non-deterministically solving UNSAT to solving a direct product version of Search-SAT using obfuscation techniques. Gain insights into the bidirectional relationship between complexity theory and cryptographic obfuscation through cutting-edge research presented by Rahul Ilango from MIT in collaboration with Alex Lombardi.
