Massachusetts Institute of Technology
February 21, 2017
This talk will survey recent progress on program obfuscation from feasibility results to applications in cryptography and complexity theory. We will also describe a simple obfuscation construction based on cryptographic multi-linear maps and give a generic proof of security. No prior knowledge in cryptography is required.