Paper 2024/1507
Unbounded ABE for Circuits from LWE, Revisited
Abstract
We introduce new lattice-based techniques for building ABE for circuits with unbounded attribute length based on the LWE assumption, improving upon the previous constructions of Brakerski and Vaikuntanathan (CRYPTO 16) and Goyal, Koppula, and Waters (TCC 16). Our main result is a simple and more efficient unbounded ABE scheme for circuits where only the circuit depth is fixed at set-up; this is the first unbounded ABE scheme for circuits that rely only on black-box access to cryptographic and lattice algorithms. The scheme achieves semi-adaptive security against unbounded collusions under the LWE assumption. The encryption time and ciphertext size are roughly $3 \times$ larger than the prior bounded ABE of Boneh et al. (EUROCRYPT 2014), substantially improving upon the encryption times in prior works. As a secondary contribution, we present an analogous result for unbounded inner product predicate encryption that satisfies weak attribute-hiding.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A minor revision of an IACR publication in ASIACRYPT 2024
- Contact author(s)
- cini valerio @ gmail com
- History
- 2024-09-30: approved
- 2024-09-26: received
- See all versions
- Short URL
- https://ia.cr/2024/1507
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1507,
author = {Valerio Cini and Hoeteck Wee},
title = {Unbounded {ABE} for Circuits from {LWE}, Revisited},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1507},
year = {2024},
url = {https://eprint.iacr.org/2024/1507}
}
