Ciphertext-Policy Attribute-Based Encryption enables fine-grained access control by binding ciphertext decryption to user attributes. While most practical schemes are pairing-based and rely on assumptions vulnera- ble to quantum attacks, lattice-based approaches offer post-quantum secu- rity at the cost of reduced expressiveness. In this work, we present the first direct benchmark of open-source implementations from both families across diverse hardware, assessing their performance toward the design of practical quantum-resilient access control systems.
Gasparini, L., Onofri, E., Palmucci, M., Pedicini, M. (2025). Comparing Lattices and Bilinear Parings in CP-ABE. In De Cifris Koine (pp.81-87). Milano : De Cifris Press [10.69091/koine/vol-8-P10].
Comparing Lattices and Bilinear Parings in CP-ABE
Gasparini, Lorenzo;Onofri, Elia
;Pedicini, Marco
2025-01-01
Abstract
Ciphertext-Policy Attribute-Based Encryption enables fine-grained access control by binding ciphertext decryption to user attributes. While most practical schemes are pairing-based and rely on assumptions vulnera- ble to quantum attacks, lattice-based approaches offer post-quantum secu- rity at the cost of reduced expressiveness. In this work, we present the first direct benchmark of open-source implementations from both families across diverse hardware, assessing their performance toward the design of practical quantum-resilient access control systems.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
