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