ABE for circuits with poly( )-sized keys from LWE

DOI10.1109/FOCS57990.2023.00032MaRDI QIDQ6942941zbMATH OpenFDO

Authors Valerio Cini, Hoeteck Wee

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS57990.2023.00032

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(4)

• Key-homomorphic computations for RAM: fully succinct randomised encodings and more
• Almost optimal KP and CP-ABE for circuits from succinct LWE
• Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
• Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more

This page was built for publication: ABE for circuits with \(\mathsf{poly}( \lambda )\)-sized keys from LWE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942941)