Cryptology ePrint Archive: Report 2014/666

Functional Encryption Without Obfuscation

Sanjam Garg and Craig Gentry and Shai Halevi and Mark Zhandry

Abstract: Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in turn either relies on an exponential number of assumptions (basically, one per circuit), or a polynomial set of assumptions, but with an exponential loss in the security reduction. Additionally these schemes are proved in the weaker selective security model, where the adversary is forced to specify its target before seeing the public parameters. For these constructions, full security can be obtained but at the cost of an exponential loss in the security reduction.

In this work, we overcome the above limitations and realize a fully secure functional encryption scheme without using indistinguishability obfuscation. Specifically the security of our scheme relies only on the polynomial hardness of simple assumptions on multilinear maps.

As a separate technical contribution of independent interest, we show how to add to existing graded encoding schemes a new \emph{extension function}, that can be though of as dynamically introducing new encoding levels.

Category / Keywords: public-key cryptography / functional encryption, graded encodings, adaptive security,

Date: received 25 Aug 2014, last revised 2 Dec 2015

Contact author: mzhandry at stanford edu

Available format(s): PDF | BibTeX Citation

Version: 20151203:021808 (All versions of this report)

Short URL: ia.cr/2014/666