Succinct randomized encodings from laconic function evaluation, faster and simpler
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Attribute-based encryption for circuits of unbounded depth from lattices
- Candidate iO from homomorphic encryption schemes
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Key-dependent message security: generic amplification and completeness
- Laconic function evaluation and applications
- Output-compressing randomized encodings and applications
- Reusable garbled circuits and succinct functional encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
- Time-lock puzzles from lattices
- Time-lock puzzles from randomized encodings
- Topology-hiding computation beyond semi-honest adversaries
Cited in
(2)
This page was built for publication: Succinct randomized encodings from laconic function evaluation, faster and simpler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891184)
