Attribute-based encryption for finite automata from LWE

DOI10.1007/978-3-319-26059-4_14MaRDI QIDQ3464400zbMATH OpenOpenAlexFDO

Authors Xavier Boyen, Qinyi Li

Publication date 27 January 2016

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26059-4_14

zbMATH Keywords

learning with errors (LWE)

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Attribute-based encryption (and more) for nondeterministic finite automata from LWE
• Attribute based encryption for deterministic finite automata from DLIN
• Attribute-based functional encryption on lattices
• ABE for DFA from k-lin
• Turing machines with shortcuts: efficient attribute-based encryption for bounded functions

Cited in

(13)

• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
• Attribute based encryption for deterministic finite automata from DLIN
• ABE for DFA from k-lin
• Attribute-based encryption (and more) for nondeterministic finite automata from LWE
• ABE for DFA from LWE against bounded collusions, revisited
• Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
• Fully Anonymous Attribute Tokens from Lattices
• Deniable Attribute Based Encryption for Branching Programs from LWE
• Attribute-based functional encryption on lattices
• Bounded Collusion ABE for TMs from IBE
• A general framework for lattice-based ABE using evasive inner-product functional encryption
• Attribute based encryption for Turing machines from lattices

This page was built for publication: Attribute-based encryption for finite automata from LWE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464400)