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

Tatsuaki Okamoto, Katsuyuki Takashima*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1491-1573
Number of pages83
JournalJournal of Cryptology
Issue number4
Publication statusPublished - 2019 Oct 1
Externally publishedYes


  • Adaptive security
  • Attribute-based encryption
  • Decisional linear assumption
  • Dual pairing vector spaces
  • Functional encryption
  • Inner-product predicate encryption

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption'. Together they form a unique fingerprint.

Cite this