Lockable Obfuscation

          @misc{ scivideos_15506,
            doi = {},
            url = {https://simons.berkeley.edu/talks/lockable-obfuscation},
            author = {},
            keywords = {},
            language = {en},
            title = {Lockable Obfuscation},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {mar},
            note = {15506 see, \url{https://scivideos.org/Simons-Institute/15506}}
          }
          

Abstract

In this talk we will discuss the notion of lockable obfuscation. In a lockable obfuscation scheme there exists an obfuscation algorithm Obf that takes as input a program PP and string called `lock ' , and outputs an obfuscated program P'. One can evaluate the obfuscated program P' on any input x where the output of evaluation is 1 iff P(x)=lock, otherwise the output is a rejecting symbol. The security requirement states that if `lock' is uniformly random, then the obfuscated program P' hides the program P. We will first discuss one of the applications of lockable obfuscation - anonymous encryption schemes. Next, we will see a construction of lockable obfuscation, followed by a proof of security based on the Learning with Errors (LWE) assumption. This talk is based on two concurrent works by Goyal-K-Waters and Wichs-Zirdelis.