Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / attribute-based encryption; full security; decisional linear assumption; asymmetric pairings

Original Publication (in the same form): ACM CCS 2017
DOI:
10.1145/3133956.3134014

Date: received 27 Aug 2017, last revised 29 Aug 2017

Contact author: shashank agraval at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170830:004209 (All versions of this report)

Short URL: ia.cr/2017/807

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]