[Resource Topic] 2019/630: ABE for DFA from k-Lin

Welcome to the resource topic for 2019/630

ABE for DFA from k-Lin

Authors: Junqing Gong, Brent Waters, Hoeteck Wee


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.

ePrint: https://eprint.iacr.org/2019/630

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

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 .