Paper 2014/207

Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption

Katsuyuki Takashima


We propose a key-policy attribute-based encryption (KP-ABE) scheme with constant-size ciphertexts, whose semi-adaptive security is proven under the decisional linear (DLIN) assumption in the standard model. The access structure is expressive, that is given by non-monotone span programs. It also has fast decryption, i.e., a decryption includes only a constant number of pairing operations. As an application of our KP-ABE construction, we also propose a fully secure attribute-based signatures with constant-size secret (signing) keys from the DLIN. For achieving the above results, we extend the sparse matrix technique on dual pairing vector spaces. In particular, several algebraic properties of an elaborately chosen sparse matrix group are applied to the dual system security proofs.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Major revision. SCN 2014
attribute-based encryptionconstant-size ciphertextsdecisional linear assumption
Contact author(s)
Takashima Katsuyuki @ aj mitsubishielectric co jp
2014-08-29: last of 3 revisions
2014-03-21: received
See all versions
Short URL
Creative Commons Attribution


      author = {Katsuyuki Takashima},
      title = {Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption},
      howpublished = {Cryptology ePrint Archive, Paper 2014/207},
      year = {2014},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.