Attribute-based encryption (and more) for nondeterministic finite automata from LWE
From MaRDI portal
Publication:2305001
DOI10.1007/978-3-030-26951-7_26OpenAlexW2967189382MaRDI QIDQ2305001
Shweta Agrawal, Shota Yamada, Monosij Maitra
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_26
Related Items (16)
Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ A survey of lattice based expressive attribute based encryption ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ A generic construction of CCA-secure attribute-based encryption with equality test ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Adaptively secure ABE for DFA from \(k\)-Lin and more ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
This page was built for publication: Attribute-based encryption (and more) for nondeterministic finite automata from LWE
