From Selective to Adaptive Security in Functional Encryption

  • Prabhanjan Ananth
  • Zvika Brakerski
  • Gil Segev
  • Vinod Vaikuntanathan
Conference paper

DOI: 10.1007/978-3-662-48000-7_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9216)
Cite this paper as:
Ananth P., Brakerski Z., Segev G., Vaikuntanathan V. (2015) From Selective to Adaptive Security in Functional Encryption. In: Gennaro R., Robshaw M. (eds) Advances in Cryptology -- CRYPTO 2015. CRYPTO 2015. Lecture Notes in Computer Science, vol 9216. Springer, Berlin, Heidelberg

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

Keywords

Functional encryption Adaptive security Generic constructions 

Copyright information

© International Association for Cryptologic Research 2015

Authors and Affiliations

  • Prabhanjan Ananth
    • 1
  • Zvika Brakerski
    • 2
  • Gil Segev
    • 3
  • Vinod Vaikuntanathan
    • 4
  1. 1.University of CaliforniaLos AngelesUSA
  2. 2.Weizmann Institute of ScienceRehovotIsrael
  3. 3.Hebrew University of JerusalemJerusalemIsrael
  4. 4.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations