
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Expressive AttributeBased Encryption with ConstantSize Ciphertexts from the Decisional Linear Assumption
Katsuyuki TAKASHIMA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E103A
No.1
pp.74106 Publication Date: 2020/01/01
Online ISSN: 17451337
DOI: 10.1587/transfun.2019CIP0009
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: attributebased encryption, constantsize ciphertexts, attributebased signatures, constantsize signing keys, nonmonotone span programs, decisional linear assumption,
Full Text: FreePDF(676.6KB)
Summary:
We propose a keypolicy attributebased encryption (KPABE) scheme with constantsize ciphertexts, whose almost tightly semiadaptive security is proven under the decisional linear (DLIN) assumption in the standard model. The access structure is expressive, that is given by nonmonotone span programs. It also has fast decryption, i.e., a decryption includes only a constant number of pairing operations. As an application of our KPABE construction, we also propose an efficient, fully secure attributebased signatures with constantsize 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.

