Paper 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
- Published elsewhere. Major revision. SCN 2014
- Keywords
- attribute-based encryptionconstant-size ciphertextsdecisional linear assumption
- Contact author(s)
- Takashima Katsuyuki @ aj mitsubishielectric co jp
- History
- 2014-08-29: last of 3 revisions
- 2014-03-21: received
- See all versions
- Short URL
- https://ia.cr/2014/207
- License
-
CC BY
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},
note = {\url{https://eprint.iacr.org/2014/207}},
url = {https://eprint.iacr.org/2014/207}
}
