Attribute based encryption for Turing machines from lattices
From MaRDI portal
Recommendations
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Bounded Collusion ABE for TMs from IBE
- Attribute-based encryption for finite automata from LWE
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Attribute-based encryption for circuits
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- ABE for DFA from k-lin
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Attribute based encryption for deterministic finite automata from DLIN
- Attribute based encryption for Turing machines from lattices
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Candidate witness encryption from lattice techniques
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- CP-ABE for circuits (and More) in the symmetric key setting
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption for regular languages
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 7829260 (Why is no real title available?)
- Multi-authority ABE from lattices without random oracles
- Multi-identity and multi-key leveled FHE from learning with errors
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Optimal broadcast encryption from pairings and LWE
- Private constrained PRFs (and more) from LWE
- Reusable garbled circuits and succinct functional encryption
- Reusable garbled deterministic finite automata from learning with errors
- Two round multiparty computation via multi-key FHE
- Witness encryption and null-iO from evasive LWE
Cited in
(11)- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Attribute based encryption for Turing machines from lattices
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Attribute-based encryption using sum-product decomposition of Boolean functions
- Faster ABE for Turing machines from circular evasive LWE
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Pseudorandom FE, iO and applications
- Zeroizing attacks against evasive and circular evasive LWE
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
This page was built for publication: Attribute based encryption for Turing machines from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652903)
