Cryptology ePrint Archive: Report 2020/1139

Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin

Huijia Lin and Ji Luo

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 [Tomida and Attrapadung, ePrint '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.

Category / Keywords: public-key cryptography /

Original Publication (with major differences): IACR-ASIACRYPT-2020

Date: received 18 Sep 2020

Contact author: rachel at cs washington edu,luoji@cs washington edu

Available format(s): PDF | BibTeX Citation

Version: 20200921:082542 (All versions of this report)

Short URL: ia.cr/2020/1139


[ Cryptology ePrint archive ]