[Resource Topic] 2020/1139: Succinct and Adaptively Secure ABE for ABP from k-Lin

Welcome to the resource topic for 2020/1139

Succinct and Adaptively Secure ABE for ABP from k-Lin

Authors: Huijia Lin, Ji Luo


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.

ePrint: https://eprint.iacr.org/2020/1139

Talk: https://www.youtube.com/watch?v=87ZFS0KmmJo

Slides: https://iacr.org/submit/files/slides/2020/asiacrypt/ac2020/419/slides.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .