International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption

Authors:
Tatsuaki Okamoto
Katsuyuki Takashima
Download:
DOI: 10.1007/s00145-018-9305-0
Search ePrint
Search Google
Abstract: This paper presents a fully secure (adaptively secure) practical functional encryption scheme for a large 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 assumption, in the standard model. Our scheme is constructed on the concept of dual pairing vector spaces and a hierarchical reduction technique on this concept is employed for the security proof. The proposed functional encryption scheme covers, as special cases, (1) key-policy, ciphertext-policy and unified-policy attribute-based encryption with non-monotone access structures, (2) (hierarchical) attribute-hiding functional encryption with inner-product relations and functional encryption with nonzero inner-product relations and (3) spatial encryption and a more general class of encryption than spatial encryption.
BibTeX
@article{jofc-2019-30118,
  title={Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption},
  journal={Journal of Cryptology},
  publisher={Springer},
  volume={32},
  pages={1491-1573},
  doi={10.1007/s00145-018-9305-0},
  author={Tatsuaki Okamoto and Katsuyuki Takashima},
  year=2019
}