Succinct LWE sampling, random polynomials, and obfuscation
From MaRDI portal
Recommendations
- Candidate obfuscation via oblivious LWE sampling
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Compressible FHE with applications to PIR
- Counterexamples to new circular security assumptions underlying iO
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster Bootstrapping with Polynomial Error
- Functional encryption for bounded collusions, revisited
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Leveled fully homomorphic signatures from standard lattices
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On Best-Possible Obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- Private constrained PRFs (and more) from LWE
- Public-key cryptosystems from the worst-case shortest vector problem
- Succinct randomized encodings and their applications
- Sum-of-squares meets program obfuscation, revisited
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
Cited in
(24)- Candidate obfuscation via oblivious LWE sampling
- Cryptanalysis of candidate obfuscators for affine determinant programs
- COA-secure obfuscation and applications
- Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Candidate iO from homomorphic encryption schemes
- Witness encryption and null-iO from evasive LWE
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Tracing quantum state distinguishers via backtracking
- Obfuscation of pseudo-deterministic quantum circuits
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Revocable cryptography from learning with errors
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Software with certified deletion
- Compressing unit-vector correlations via sparse pseudorandom generators
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Towards general-purpose program obfuscation via local mixing
- Indistinguishability obfuscation from well-founded assumptions
- Obfuscating pseudorandom functions is post-quantum complete
- Pseudorandom FE, iO and applications
- 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: Succinct LWE sampling, random polynomials, and obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697860)
