ABE for Circuits with poly (λ) -sized Keys from LWE

Valerio Cini (Author and Speaker), Hoeteck Wee

Research output: Chapter in Book or Conference ProceedingsConference Proceedings with Oral Presentationpeer-review

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 poly(depth ,λ) to poly (λ). The starting point of our construction is a recent ABE scheme of Li, Lin, and Luo (TCC 2022), which achieves poly (λ) key size but requires pairings and generic bilinear groups in addition to LWE; we introduce new lattice techniques to eliminate the additional requirements.
Original languageEnglish
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Pages435-446
Number of pages12
ISBN (Electronic)979-8-3503-1894-4
DOIs
Publication statusPublished - 2023
Event2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) - Santa Cruz, CA, Santa Cruz, United States
Duration: 6 Nov 20239 Nov 2023

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Other

Other2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
Country/TerritoryUnited States
CitySanta Cruz
Period6/11/239/11/23

Research Field

  • Cyber Security

Keywords

  • Attribute-based Encryption
  • Lattice-based Cryptography

Fingerprint

Dive into the research topics of 'ABE for Circuits with poly (λ) -sized Keys from LWE'. Together they form a unique fingerprint.

Cite this