Advertisement
Published in:
2014 | OriginalPaper | Chapter
Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
Author : Katsuyuki Takashima
Published in: Security and Cryptography for Networks
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 proposed scheme also has
semi-adaptively
security, which is a recently proposed notion of security. 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 employ a hierarchical reduction technique on dual pairing vector spaces and a modified form of pairwise independence lemma specific to our proposed schemes.