Cryptology ePrint Archive: Report 2014/917

From Selective to Adaptive Security in Functional Encryption

Prabhanjan Ananth and Zvika Brakerski and Gil Segev and Vinod Vaikuntanathan

Abstract: In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, security is guaranteed only for messages that are fixed ahead of time (i.e., before the adversary even interacts with the system). This so-called selective security is too restrictive for many realistic applications. Achieving adaptive security (also called full security), where security is guaranteed even for messages that are adaptively chosen at any point in time, seems significantly more challenging. The handful of known adaptively-secure schemes are based on specifically tailored techniques that rely on strong assumptions (such as obfuscation or multilinear maps assumptions).

We show that any sufficiently-expressive selectively-secure FE scheme can be transformed into an adaptively-secure one without introducing any additional assumptions. We present a black-box transformation, for both public-key and private-key schemes, making novel use of hybrid encryption, a classical technique that was originally introduced for improving the efficiency of encryption schemes. We adapt the hybrid encryption approach to the setting of functional encryption via a technique for embedding a "hidden execution thread'' in the decryption keys of the underlying scheme, which will only be activated within the proof of security of the resulting scheme. As an additional application of this technique, we show how to construct functional encryption schemes for arbitrary circuits starting from ones for shallow circuits (NC1 or even TC0).

Category / Keywords: public-key cryptography / Functional encryption, Minimal assumptions, Selective security, Adaptive security

Date: received 6 Nov 2014, last revised 16 Feb 2015

Contact author: prabhanjan va at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150216:225627 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]