TY - GEN

T1 - Decomposable Obfuscation

T2 - 15th International Conference on Theory of Cryptography, TCC 2017

AU - Liu, Qipeng

AU - Zhandry, Mark Landry

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85034217124&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034217124&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-70500-2_6

DO - 10.1007/978-3-319-70500-2_6

M3 - Conference contribution

AN - SCOPUS:85034217124

SN - 9783319704999

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 138

EP - 169

BT - Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings

A2 - Kalai, Yael

A2 - Reyzin, Leonid

PB - Springer Verlag

Y2 - 12 November 2017 through 15 November 2017

ER -