Paper 2024/1780
ABE for Circuits with $\mathsf{poly}(\lambda)$-sized Keys from LWE
Abstract
We present a key-policy attribute-based encryption (ABE) scheme for circuits based on the Learning With Errors (LWE) assumption whose key size is independent of the circuit depth. Our result constitutes the first improvement for ABE for circuits from LWE in almost a decade, given by Gorbunov, Vaikuntanathan, and Wee (STOC 2013) and Boneh, et al. (EUROCRYPT 2014) -- we reduce the key size in the latter from $\mathsf{poly}(\mbox{depth},\lambda)$ to $\mathsf{poly}(\lambda)$. The starting point of our construction is a recent ABE scheme of Li, Lin, and Luo (TCC 2022), which achieves $\mathsf{poly}(\lambda)$ key size but requires pairings and generic bilinear groups in addition to LWE; we introduce new lattice techniques to eliminate the additional requirements.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. FOCS 2023
- Keywords
- attribute-based encryptionlattice-based cryptography
- Contact author(s)
- cini valerio @ gmail com
- History
- 2024-11-01: revised
- 2024-10-31: received
- See all versions
- Short URL
- https://ia.cr/2024/1780
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1780,
author = {Valerio Cini and Hoeteck Wee},
title = {{ABE} for Circuits with $\mathsf{poly}(\lambda)$-sized Keys from {LWE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1780},
year = {2024},
url = {https://eprint.iacr.org/2024/1780}
}
