ABE for DFA from k-lin

DOI10.1007/978-3-030-26951-7_25MaRDI QIDQ2305000zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

attribute-based encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

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

(24)

• 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
• Attribute based encryption for deterministic finite automata from DLIN
• Unbounded dynamic predicate compositions in ABE from standard assumptions
• ABE for DFA from LWE against bounded collusions, revisited
• Attribute-based encryption for finite automata from LWE
• Public-key puncturable encryption: modular and compact constructions
• Bounded Collusion ABE for TMs from IBE
• A generic construction of CCA-secure attribute-based encryption with equality test
• Revisiting updatable encryption: controlled forward security, constructions and a puncturable perspective
• Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
• Registered ABE via predicate encodings
• Attribute based encryption for Turing machines from lattices
• Faster ABE for Turing machines from circular evasive LWE
• Non-committing identity based encryption: constructions and applications
• Registered FE beyond predicates: (attribute-based) linear functions and more
• Unbounded dynamic predicate compositions in ABE from standard assumptions
• A general framework for registered functional encryption via user-specific pre-constraining
• Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
• Pseudorandom FE, iO and applications

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)