ABE for DFA from k-Lin - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

ABE for DFA from k-Lin


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.
No file

Dates and versions

hal-02358440 , version 1 (11-11-2019)



Junqing Gong, Brent Waters, Hoeteck Wee. ABE for DFA from k-Lin. CRYPTO 2019 - 39th Annual International Cryptology Conference, Aug 2019, Santa Barbara, United States. pp.732-764, ⟨10.1007/978-3-030-26951-7_25⟩. ⟨hal-02358440⟩
455 View
0 Download



Gmail Facebook X LinkedIn More