Paper 2017/807
FAME: Fast Attribute-based Message Encryption
Shashank Agrawal and Melissa Chase
Abstract
Time and again, attribute-based encryption has been shown to be the natural cryptographic tool for building various types of conditional access systems with far-reaching applications, but the deployment of such systems has been very slow. A central issue is the lack of an encryption scheme that can operate on sensitive data very efficiently and, at the same time, provides features that are important in practice. This paper proposes the first fully secure ciphertext-policy and key-policy ABE schemes based on a standard assumption on Type-III pairing groups, which do not put any restriction on policy type or attributes. We implement our schemes along with several other prominent ones using the Charm library, and demonstrate that they perform better on almost all parameters of interest.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. ACM CCS 2017
- DOI
- 10.1145/3133956.3134014
- Keywords
- attribute-based encryptionfull securitydecisional linear assumptionasymmetric pairings
- Contact author(s)
- shashank agraval @ gmail com
- History
- 2017-08-30: last of 2 revisions
- 2017-08-28: received
- See all versions
- Short URL
- https://ia.cr/2017/807
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/807,
author = {Shashank Agrawal and Melissa Chase},
title = {{FAME}: Fast Attribute-based Message Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/807},
year = {2017},
doi = {10.1145/3133956.3134014},
url = {https://eprint.iacr.org/2017/807}
}
