[Resource Topic] 2024/1780: ABE for Circuits with $\mathsf{poly}(\lambda)$-sized Keys from LWE

Welcome to the resource topic for 2024/1780

Title:
ABE for Circuits with \mathsf{poly}(\lambda)-sized Keys from LWE

Authors: Valerio Cini, Hoeteck Wee

Abstract:

e 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.

ePrint: https://eprint.iacr.org/2024/1780

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .