ABE for DFA from k-Lin

Junqing Gong (1, 2, 3) , Brent Waters (4) , Hoeteck Wee (1, 3, 2)

1 DI-ENS - Département d'informatique - ENS Paris
2 PSL - Université Paris Sciences et Lettres
3 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
4 Computer Science Department [Austin]

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.

Domaines: Cryptographie et sécurité [cs.CR]

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⟩