Lower Bounds on Obfuscation from All or Nothing Encryption

Lower Bounds on Obfuscation from All or Nothing Encryption

Explore a presentation from Crypto 2017 on lower bounds for obfuscation derived from all-or-nothing encryption. Delve into the paper by Sanjam Garg, Mohammad Mahmoody, and Ameer Mohammed as they discuss key assumptions for indistinguishability obfuscation, the nature of all-or-nothing constructs, and blackbox implementations. Examine high-level concepts, the definition of idealized oracles and decryption processes, and the role of hidden queries in this cryptographic research. Gain insights into cutting-edge obfuscation techniques and their theoretical foundations in this 21-minute talk that covers introduction, assumptions, constructions, and a comprehensive summary of findings.