CryptoDB
Fast, Compact, and Expressive Attribute-Based Encryption
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Attribute-based encryption (ABE) is an advanced cryptographic tool and useful to build various types of access control systems. Toward the goal of making ABE more practical, we propose key-policy (KP) and ciphertext-policy (CP) ABE schemes, which first support unbounded sizes of attribute sets and policies with negation and multi-use of attributes, allow fast decryption, and are adaptively secure under a standard assumption, simultaneously. Our schemes are more expressive than previous schemes and efficient enough. To achieve the adaptive security along with the other properties, we refine the technique introduced by Kowalczyk and Wee (Eurocrypt’19) so that we can apply the technique more expressive ABE schemes. Furthermore, we also present a new proof technique that allows us to remove redundant elements used in their ABE schemes. We implement our schemes in 128-bit security level and present their benchmarks for an ordinary personal computer and smartphones. They show that all algorithms run in one second with the personal computer when they handle any policy or attribute set with one hundred attributes. |
Video from PKC 2020
BibTeX
@article{pkc-2020-30281,
title={Fast, Compact, and Expressive Attribute-Based Encryption},
booktitle={Public-Key Cryptography – PKC 2020},
series={Public-Key Cryptography – PKC 2020},
publisher={Springer},
volume={12110},
pages={3-33},
doi={10.1007/978-3-030-45374-9_1},
author={Junichi Tomida and Yuto Kawahara and Ryo Nishimaki},
year=2020
}