[Wee25] Almost Optimal KP and CP-ABE for Circuits from Succinct LWE

Authors: Hoeteck Wee | Venue: EUROCRYPT 2025 | Source

Abstract

We construct key-policy (KP) and ciphertext-policy (CP) attribute-based encryption (ABE) for circuits with almost-optimal parameters — $O(1)$ ciphertext size, $O(1)$ secret key size, and $O(1)$ public key size — from a new assumption called succinct LWE (introduced in the author’s prior CRYPTO 2024 work on CP-ABE for ${\mathsf{NC}}^1$). The $\ell$-succinct LWE assumption states that an LWE instance is indistinguishable from uniform even given a trapdoor for $[I_{\ell }\otimes \mathbf{B}\mid \mathbf{W}]$, where $\ell =\mathrm{poly}(\lambda )$. This is a strengthening of evasive LWE that enables encoding circuit depth information succinctly. We also construct laconic function evaluation (LFE) with $O(1)$-size CRS and digest. The constructions use a circular small-secret variant of succinct LWE.

BibTeX

Copy

@Inproceedings{EC:Wee25,
  author = {Hoeteck Wee},
  title = {Almost Optimal {KP} and {CP}-{ABE} for Circuits from Succinct {LWE}},
  pages = {34--62},
  editor = {Serge Fehr and Pierre-Alain Fouque},
  booktitle = {Advances in Cryptology -- {EUROCRYPT}~2025, Part~III},
  volume = {15603},
  series = {Lecture Notes in Computer Science},
  address = {Madrid, Spain},
  month = {may~4--8},
  publisher = {Springer, Cham, Switzerland},
  year = {2025},
  doi = {10.1007/978-3-031-91131-6_2},
}