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 (selective) 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) key from the DLIN assumption. For achieving the above results, we employ a hierarchical reduction technique on dual pairing vector spaces (DPVS), where a high-level problem given on DPVS is used for proving the scheme security and then the security of the problem is reduced to that of the DLIN problem.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- 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