Attribute-Based Encryption for Finite Automata from LWE

DOI10.1007/978-3-319-26059-4_14zbMath1388.94036OpenAlexW2399043040MaRDI QIDQ3464400

Qinyi Li, Xavier Boyen

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)

Related Items (5)

Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions

This page was built for publication: Attribute-Based Encryption for Finite Automata from LWE