Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

  • Tatsuaki Okamoto
  • Katsuyuki Takashima
Conference paper

DOI: 10.1007/978-3-642-14623-7_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)
Cite this paper as:
Okamoto T., Takashima K. (2010) Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a well-established assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, (1) key-policy and ciphertext-policy attribute-based encryption with non-monotone access structures, and (2) (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Tatsuaki Okamoto
    • 1
  • Katsuyuki Takashima
    • 2
  1. 1.NTTTokyoJapan
  2. 2.Mitsubishi ElectricKanagawaJapan

Personalised recommendations