Paper 2023/1814

Easy-ABE: An Easy Ciphertext-Policy Attribute-Based Encryption

Ahmad Khoureich Ka
Abstract

Attribute-Based Encryption is widely recognized as a leap forward in the field of public key encryption. It allows to enforce an access control on encrypted data. Decryption time in ABE schemes can be long depending on the number of attributes and pairing operations. This drawback hinders their adoption on a broader scale. In this paper, we propose a non-monotone CP-ABE scheme that has no restrictions on the size of attribute sets and policies, allows fast decryption and is adaptively secure under the CBDH-3 assumption. To achieve this, we approached the problem from a new angle, namely using a set membership relation for access structure. We have implemented our scheme using the Charm framework and the source code is available on GitHub. Easy-ABE performs better than FAME an FABEO.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. 15th International Conference, SecITC 2022
DOI
10.1007/978-3-031-32636-3_10
Keywords
attribute-based encryptionCBDH-3 assumptionnon-monotonerandom oracle model
Contact author(s)
ahmadkhoureich ka @ uadb edu sn
History
2024-02-15: last of 2 revisions
2023-11-24: received
See all versions
Short URL
https://ia.cr/2023/1814
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2023/1814,
      author = {Ahmad Khoureich Ka},
      title = {Easy-ABE: An Easy Ciphertext-Policy Attribute-Based Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1814},
      year = {2023},
      doi = {10.1007/978-3-031-32636-3_10},
      note = {\url{https://eprint.iacr.org/2023/1814}},
      url = {https://eprint.iacr.org/2023/1814}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.