ABE for DFA from k-Lin

Junqing Gong; Brent Waters; Hoeteck Wee

Paper 2019/630

ABE for DFA from k-Lin

Junqing Gong, 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.

Metadata

Available format(s): PDF
Publication info: A major revision of an IACR publication in CRYPTO 2019
Contact author(s): junqing gong @ ens fr
bwaters @ cs utexas edu
wee @ di ens fr
History: 2019-06-03: received
Short URL: https://ia.cr/2019/630
License: CC BY

BibTeX

@misc{cryptoeprint:2019/630,
      author = {Junqing Gong and Brent Waters and Hoeteck Wee},
      title = {ABE for DFA from k-Lin},
      howpublished = {Cryptology ePrint Archive, Paper 2019/630},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/630}},
      url = {https://eprint.iacr.org/2019/630}
}