ABE Cubed: Advanced Benchmarking Extensions for ABE Squared
Open Access
- 5 September 2025
- journal article
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (4) , 544-587
Abstract
Since attribute-based encryption (ABE) was proposed in 2005, it has established itself as a valuable tool in the enforcement of access control. For practice, it is important that ABE satisfies many desirable properties such as multi-authority and negations support. Nowadays, we can attain these properties simultaneously, but none of these schemes have been implemented. Furthermore, although simpler schemes have been optimized extensively on a structural level, there is still much room for improvement for these more advanced schemes. However, even if we had schemes with such structural improvements, we would not have a way to benchmark and compare them fairly to measure the effect of such improvements. The only framework that aims to achieve this goal, ABE Squared (TCHES ’22), was designed with simpler schemes in mind.In this work, we propose the ABE Cubed framework, which provides advanced benchmarking extensions for ABE Squared. To motivate our framework, we first apply structural improvements to the decentralized ciphertext-policy ABE scheme supporting negations presented by Riepel, Venema and Verma (ACM CCS ’24), which results in five new schemes with the same properties. We use these schemes to uncover and bridge the gaps in the ABE Squared framework. In particular, we observe that advanced schemes depend on more “variables” that affect the schemes’ efficiency in different dimensions. Whereas ABE Squared only considered one dimension (as was sufficient for the schemes considered there), we devise a benchmarking strategy that allows us to analyze the schemes in multiple dimensions. As a result, we obtain a more complete overview on the computational efficiency of the schemes, and ultimately, this allows us to make better-founded choices about which schemes provide the best efficiency trade-offs for practice.Keywords
This publication has 19 references indexed in Scilit:
- SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic CurvesJournal of Cryptology, 2024
- A Practical Compiler for Attribute-Based Encryption: New Decentralized Constructions and More2023
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practiceDesigns, Codes and Cryptography, 2022
- Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions2020
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption2015
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More2014
- Unbounded HIBE and Attribute-Based Encryption2011
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization2011
- Cryptographic Cloud Storage2010
- Fuzzy Identity-Based Encryption2005