Cryptology ePrint Archive: Report 2017/209

Exploding Obfuscation: A Framework for Building Applications of Obfuscation From Polynomial Hardness

Qipeng Liu and Mark Zhandry

Abstract: There is some evidence that indistinguishability obfuscation (iO) requires either exponentially many assumptions or (sub)exponentially hard assumptions, and indeed, all known ways of building obfuscation suffer one of these two limitations. As such, any application built from iO suffers from these limitations as well. However, for most applications, such limitations do not appear to be inherent to the application, just the approach using iO. Indeed, several recent works have shown how to base applications of iO instead on functional encryption (FE), which can in turn be based on the polynomial hardness of just a few assumptions. However, these constructions are quite complicated and recycle a lot of similar techniques. In this work, we unify the results of previous works in the form of a weakened notion of obfuscation, called Exploding iO. We show (1) how to build exploding iO from functional encryption, and (2) how to build a variety of applications from exploding iO, including all of the applications already known from FE. The construction in (1) hides most of the difficult techniques in the prior work, whereas the constructions in (2) are much closer to the comparatively simple constructions from iO. As such, exploding iO represents a convenient new platform for obtaining more applications from polynomial hardness.

Category / Keywords: indistinguishability obfuscation, functional encryption

Date: received 28 Feb 2017

Contact author: qipengl at princeton edu

Available format(s): PDF | BibTeX Citation

Version: 20170301:001947 (All versions of this report)

Short URL: ia.cr/2017/209

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]