Paper 2014/207 Original: eprint.iacr.org/2014/207 ↗

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

Katsuyuki Takashima
Abstract

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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2014-08-29: last updated
2014-03-21: published
Short URL
https://ia.cr/2014/207
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/207,
      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},
      url = {https://eprint.iacr.org/2014/207}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.