Laconic function evaluation and ABE for RAMs from (Ring-)LWE
From MaRDI portal
Recommendations
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Laconic function evaluation for Turing machines
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
Cites work
- Can we access a database both locally and privately?
- Candidate witness encryption from lattice techniques
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully succinct garbled RAM
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Laconic function evaluation for Turing machines
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Laconic oblivious transfer and its applications
- Leveled fully homomorphic signatures from standard lattices
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- On the plausibility of fully homomorphic encryption for RAMs
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Predicate encryption for circuits from LWE
- Private anonymous data access
- Private constrained PRFs (and more) from LWE
- Reusable garbled circuits and succinct functional encryption
- Software protection and simulation on oblivious RAMs
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- Towards doubly efficient private information retrieval
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Zig-zag sort
Cited in
(9)- Laconic function evaluation for Turing machines
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Faster ABE for Turing machines from circular evasive LWE
- Laconic cryptography with preprocessing
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
This page was built for publication: Laconic function evaluation and ABE for RAMs from (Ring-)LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652894)
