Paper 2022/613
GLUE: Generalizing Unbounded Attribute-Based Encryption for Flexible Efficiency Trade-Offs
Abstract
Ciphertext-policy attribute-based encryption is a versatile primitive that has been considered extensively to securely manage data in practice. Especially completely unbounded schemes are attractive, because they do not restrict the sets of attributes and policies. So far, any such schemes that support negations in the access policy or that have online/offline extensions have an inefficient decryption algorithm. In this work, we propose GLUE (Generalized, Large-universe, Unbounded and Expressive), which is a novel scheme that allows for the efficient implementation of the decryption while allowing the support of both negations and online/offline extensions. We achieve these properties simultaneously by uncovering an underlying dependency between encryption and decryption, which allows for a flexible trade-off in their efficiency. For the security proof, we devise a new technique that enables us to generalize multiple existing schemes. As a result, we obtain a completely unbounded scheme supporting negations that, to the best of our knowledge, outperforms all existing such schemes in the decryption algorithm.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in PKC 2023
- Keywords
- attribute-based encryptionunbounded attribute-based encryptiononlineoffline attribute-based encryptionnon-monotone attribute-based encryption
- Contact author(s)
-
mvenemacrypto @ gmail com
g alpar @ cs ru nl - History
- 2023-02-16: last of 2 revisions
- 2022-05-23: received
- See all versions
- Short URL
- https://ia.cr/2022/613
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/613,
author = {Marloes Venema and Greg Alpár},
title = {{GLUE}: Generalizing Unbounded Attribute-Based Encryption for Flexible Efficiency Trade-Offs},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/613},
year = {2022},
url = {https://eprint.iacr.org/2022/613}
}
