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

3 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique - ENS Paris, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
Abstract : We present compact attribute-based encryption (ABE) schemes for NC1 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 atttribute 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.
Document type :
Conference papers
Domain :

https://hal.inria.fr/hal-02358429
Contributor : Hoeteck Wee Connect in order to contact the contributor
Submitted on : Monday, November 11, 2019 - 10:38:13 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:03 PM

### Citation

Lucas Kowalczyk, Hoeteck Wee. Compact Adaptively Secure ABE for $\mathsf {NC^1}$ from k-Lin. EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2019, Darmstadt, Germany. pp.3-33, ⟨10.1007/978-3-030-17653-2_1⟩. ⟨hal-02358429⟩

Record views