ABE for DFA from k-lin
From MaRDI portal
Publication:2305000
DOI10.1007/978-3-030-26951-7_25OpenAlexW2968829294MaRDI QIDQ2305000FDOQ2305000
Authors: Junqing Gong, Brent Waters, Hoeteck Wee 
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_25
Recommendations
- Attribute based encryption for deterministic finite automata from DLIN
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Attribute-based encryption for finite automata from LWE
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
Cited In (16)
- Revisiting updatable encryption: controlled forward security, constructions and a puncturable perspective
- Bounded Collusion ABE for TMs from IBE
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- A generic construction of CCA-secure attribute-based encryption with equality test
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Registered ABE via predicate encodings
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Attribute based encryption for deterministic finite automata from DLIN
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Attribute based encryption for Turing machines from lattices
- ABE for DFA from LWE against bounded collusions, revisited
- Tag-based ABE in prime-order groups via pair encoding
- Public-Key Puncturable Encryption: Modular and Compact Constructions
This page was built for publication: ABE for DFA from \(k\)-lin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305000)
