Cryptology ePrint Archive: Report 2019/630

ABE for DFA from k-Lin

Junqing Gong and Brent Waters and Hoeteck Wee

Abstract: We present the first attribute-based encryption (ABE) scheme for deterministic finite automaton (DFA) based on static assumptions in bilinear groups; this resolves an open problem posed by Waters (CRYPTO 2012). Our main construction achieves selective security against unbounded collusions under the standard $k$-linear assumption in prime-order bilinear groups, whereas previous constructions all rely on $q$-type assumptions.

Category / Keywords:

Original Publication (with major differences): IACR-CRYPTO-2019

Date: received 2 Jun 2019, last revised 2 Jun 2019

Contact author: junqing gong at ens fr,bwaters@cs utexas edu,wee@di ens fr

Available format(s): PDF | BibTeX Citation

Version: 20190603:072717 (All versions of this report)

Short URL: ia.cr/2019/630


[ Cryptology ePrint archive ]