On the Complexity of Compressing Obfuscation

On the Complexity of Compressing Obfuscation

Explore a conference talk on the complexity of compressing obfuscation, presented at Crypto 2018. Delve into the paper by Gilad Asharov, Naomi Ephraim, Ilan Komargodski, and Rafael Pass, which examines indistinguishability obfuscation, compression hierarchy, and their implications. Learn about the existence of io, the impact of results, the black-box model, and statistically secure compressing obfuscation. Gain insights into this 22-minute presentation that covers key concepts in cryptography and obfuscation techniques.