Fully Secure Functional Encryption With General Relations From the Decisional Linear Assumption

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 standard assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, key-policy and ciphertext-policy attribute-based encryption with nonmonotone access structures, and (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.