Paper 2019/224
Compact Adaptively Secure ABE for NC1 from k-Lin
Lucas Kowalczyk and Hoeteck Wee
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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2019
- Keywords
- attribute-based encryptionadaptive securitybilinear maps
- Contact author(s)
- luke @ cs columbia edu
- History
- 2019-07-08: last of 2 revisions
- 2019-02-27: received
- See all versions
- Short URL
- https://ia.cr/2019/224
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/224,
author = {Lucas Kowalczyk and Hoeteck Wee},
title = {Compact Adaptively Secure ABE for NC1 from k-Lin},
howpublished = {Cryptology ePrint Archive, Paper 2019/224},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/224}},
url = {https://eprint.iacr.org/2019/224}
}
