Key-homomorphic computations for RAM: fully succinct randomised encodings and more
From MaRDI portal
Cites work
- A simple construction of iO for Turing machines
- ABE for circuits with \(\mathsf{poly}( \lambda )\)-sized keys from LWE
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Attribute based encryption for Turing machines from lattices
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits of unbounded depth from lattices
- Candidate obfuscation via oblivious LWE sampling
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Collusion-resistant functional encryption for RAMs
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Factoring and pairings are not necessary for iO: circular-secure LWE suffices
- Faster ABE for Turing machines from circular evasive LWE
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fuzzy Identity-Based Encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to run Turing machines on encrypted data
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- scientific article; zbMATH DE number 7829334 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Laconic function evaluation and applications
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Leveled fully homomorphic signatures from standard lattices
- On the plausibility of fully homomorphic encryption for RAMs
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Optimal broadcast encryption from pairings and LWE
- Registered ABE and adaptively-secure broadcast encryption from succinct LWE
- Registered attribute-based encryption
- Reusable garbled circuits and succinct functional encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Succinct randomized encodings and their applications
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Time-lock puzzles from lattices
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
Cited in
(4)
This page was built for publication: Key-homomorphic computations for RAM: fully succinct randomised encodings and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863932)
