IEICE TRANSACTIONS on Fundamentals
Open Access
Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
-
Full Text Views
20
- Cite this
- Free PDF (676.6KB)
Summary :
We propose a key-policy attribute-based encryption (KP-ABE) scheme with constant-size ciphertexts, whose almost tightly 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 an efficient, 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.1 pp.74-106
- Publication Date
- 2020/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019CIP0009
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
Authors
Katsuyuki TAKASHIMA
Mitsubishi Electric Corporation
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Katsuyuki TAKASHIMA, "Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 74-106, January 2020, doi: 10.1587/transfun.2019CIP0009.
Abstract: We propose a key-policy attribute-based encryption (KP-ABE) scheme with constant-size ciphertexts, whose almost tightly 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 an efficient, 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0009/_p
Copy
@ARTICLE{e103-a_1_74,
author={Katsuyuki TAKASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption},
year={2020},
volume={E103-A},
number={1},
pages={74-106},
abstract={We propose a key-policy attribute-based encryption (KP-ABE) scheme with constant-size ciphertexts, whose almost tightly 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 an efficient, 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.},
keywords={},
doi={10.1587/transfun.2019CIP0009},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 74
EP - 106
AU - Katsuyuki TAKASHIMA
PY - 2020
DO - 10.1587/transfun.2019CIP0009
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - We propose a key-policy attribute-based encryption (KP-ABE) scheme with constant-size ciphertexts, whose almost tightly 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 an efficient, 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.
ER -
English
