1. FAME: Fast Attribute-based Message Encryption 2017 ABE CCS Implementation Pairings
    Shashank Agrawal and Melissa Chase
    [View PDF on acmccs.github.io]
    [Show BibTex Citation]

    @inproceedings{10.1145/3133956.3134014,
    author = {Agrawal, Shashank and Chase, Melissa},
    title = {FAME: Fast Attribute-Based Message Encryption},
    year = {2017},
    isbn = {9781450349468},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    url = {https://doi.org/10.1145/3133956.3134014},
    doi = {10.1145/3133956.3134014},
    booktitle = {Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security},
    pages = {665–682},
    numpages = {18},
    keywords = {decisional linear assumption, attribute-based encryption, full security, asymmetric pairings},
    location = {Dallas, Texas, USA},
    series = {CCS ’17}
    }

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.

  1.