Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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 Decomposable Obfuscation. We show (1) how to build decomposable obfuscation from functional encryption, and (2) how to build a variety of applications from decomposable obfuscation, 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, decomposable obfuscation represents a convenient new platform for obtaining more applications from polynomial hardness.

Original languageEnglish (US)
Title of host publicationTheory of Cryptography - 15th International Conference, TCC 2017, Proceedings
EditorsYael Kalai, Leonid Reyzin
PublisherSpringer Verlag
Pages138-169
Number of pages32
ISBN (Print)9783319704999
DOIs
StatePublished - Jan 1 2017
Event15th International Conference on Theory of Cryptography, TCC 2017 - Baltimore, United States
Duration: Nov 12 2017Nov 15 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10677 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Conference on Theory of Cryptography, TCC 2017
CountryUnited States
CityBaltimore
Period11/12/1711/15/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness'. Together they form a unique fingerprint.

  • Cite this

    Liu, Q., & Zhandry, M. L. (2017). Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. In Y. Kalai, & L. Reyzin (Eds.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (pp. 138-169). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10677 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-70500-2_6