Sciweavers

Share
TCC
2016
Springer

Functional Encryption Without Obfuscation

3 years 4 months ago
Functional Encryption Without Obfuscation
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 most of 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 an adaptively secure functional encryption scheme without using indistinguishability obfuscation. Specifically the security of our scheme relies only on the polynomial hardness of simple assumptions on composite order multilinear maps. Though we do not currently have secure instantiations for these assumptions, we expect that multili...
Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhand
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCC
Authors Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry
Comments (0)
books