You are looking at a specific version 20200921:082542 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in ASIACRYPT 2020
Contact author(s)
rachel @ cs washington edu,luoji @ cs washington edu
History
2022-03-16: revised
2020-09-21: received
See all versions
Short URL
https://ia.cr/2020/1139
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.