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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Okamoto, T., & Takashima, K. (2010). Fully secure functional encryption with general relations from the decisional linear assumption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6223 LNCS, pp. 191–208). https://doi.org/10.1007/978-3-642-14623-7_11
Mendeley helps you to discover research relevant for your work.