Sanjam Garg: Avoiding Sub-Exponential Loss in Obfustopia

Friday, December 11, 2015 - 10:30am to 12:00pm
Hewlett G882
Sanjam Garg, Computer Science Division, Univ. of California, Berkeley

Abstract: Various applications of indistinguishability obfuscation suffer from an exponential loss in the security reduction. In this talk, I will describe how this loss can be circumvented in various contexts. In particular, I will show how non-interactive key exchange and PPAD hardness can be based on polynomially hard public key functional encryption.

Based on joint works with Omkant Pandey, Akshayaram Srinivasan and Mark Zhandry.