Skip to Main content Skip to Navigation
Conference papers

ABE for DFA from k-Lin

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Hoeteck Wee Connect in order to contact the contributor
Submitted on : Monday, November 11, 2019 - 10:45:40 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:03 PM



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⟩



Record views