Paper 2019/645
Attribute Based Encryption for Deterministic Finite Automata from DLIN
Shweta Agrawal, Monosij Maitra, and Shota Yamada
Abstract
Waters [Crypto, 2012] provided the first attribute based encryption scheme ABE for Deterministic Finite Automata (DFA) from a parametrized or ``q-type'' assumption over bilinear maps. Obtaining a construction from static assumptions has been elusive, despite much progress in the area of ABE.
In this work, we construct the first attribute based encryption scheme for DFA from static assumptions on pairings, namely, the DLIN assumption. Our scheme supports unbounded length inputs, unbounded length machines and unbounded key requests. In more detail, secret keys in our construction are associated with a DFA
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- A minor revision of an IACR publication in TCC 2019
- Keywords
- Attribute-based encryptiondeterministic finite automatadecisional linear assumption
- Contact author(s)
-
shweta a @ gmail com
monosij maitra @ gmail com
yamada-shota @ aist go jp - History
- 2019-09-20: last of 4 revisions
- 2019-06-04: received
- See all versions
- Short URL
- https://ia.cr/2019/645
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/645, author = {Shweta Agrawal and Monosij Maitra and Shota Yamada}, title = {Attribute Based Encryption for Deterministic Finite Automata from {DLIN}}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/645}, year = {2019}, url = {https://eprint.iacr.org/2019/645} }