International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Compact Adaptively Secure ABE for $\mathsf {NC^1}$ from k-Lin

Authors:
Lucas Kowalczyk
Hoeteck Wee
Download:
DOI: 10.1007/978-3-030-17653-2_1
Search ePrint
Search Google
Abstract: We present compact attribute-based encryption (ABE) schemes for $$\mathsf {NC^1}$$ that are adaptively secure under the k-Lin assumption with polynomial security loss. Our KP-ABE scheme achieves ciphertext size that is linear in the attribute length and independent of the policy size even in the many-use setting, and we achieve an analogous efficiency guarantee for CP-ABE. This resolves the central open problem posed by Lewko and Waters (CRYPTO 2011). Previous adaptively secure constructions either impose an attribute “one-use restriction” (or the ciphertext size grows with the policy size), or require q-type assumptions.
BibTeX
@article{eurocrypt-2019-29329,
  title={Compact Adaptively Secure ABE for $$\mathsf {NC^1}$$ from k-Lin},
  booktitle={Advances in Cryptology – EUROCRYPT 2019},
  series={Advances in Cryptology – EUROCRYPT 2019},
  publisher={Springer},
  volume={11476},
  pages={3-33},
  doi={10.1007/978-3-030-17653-2_1},
  author={Lucas Kowalczyk and Hoeteck Wee},
  year=2019
}