International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: ABE for DFA from k-Lin

Authors:
Junqing Gong
Brent Waters
Hoeteck Wee
Download:
DOI: 10.1007/978-3-030-26951-7_25
Search ePrint
Search Google
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.
Video from CRYPTO 2019
Video provided under Creative Commons / CC BY 3.0
BibTeX
@article{crypto-2019-29904,
  title={ABE for DFA from k-Lin},
  booktitle={Advances in Cryptology – CRYPTO 2019},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={11693},
  pages={732-764},
  doi={10.1007/978-3-030-26951-7_25},
  author={Junqing Gong and Brent Waters and Hoeteck Wee},
  year=2019
}