Paper 2020/1139 Original: eprint.iacr.org/2020/1139 ↗
Succinct and Adaptively Secure ABE for ABP from k-Lin
Abstract
We present *succinct* and *adaptively secure* attribute-based encryption (ABE) schemes for *arithmetic branching programs*, based on k-Lin in pairing groups. Our key-policy ABE scheme has ciphertexts of *constant size*, independent of the length of the attributes, and our ciphertext-policy ABE scheme has secret keys of *constant size*. Our schemes improve upon the recent succinct ABE schemes in [Attrapadung and Tomida, Asiacrypt '20], which only handle Boolean formulae. All other prior succinct ABE schemes either achieve only selective security or rely on $q$-type assumptions. Our schemes are obtained through a general and modular approach that combines a public-key inner-product functional encryption satisfying a new security notion called gradual simulation security and an information-theoretic randomized encoding scheme called arithmetic key garbling scheme.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2022-03-16: last updated
- 2020-09-21: published
- Short URL
- https://ia.cr/2020/1139
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/1139,
author = {Huijia Lin and Ji Luo},
title = {Succinct and Adaptively Secure ABE for ABP from k-Lin},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/1139},
year = {2020},
url = {https://eprint.iacr.org/2020/1139}
}