Structured-seed local pseudorandom generators and their applications
From MaRDI portal
Cites work
- 10-party sublinear secure computation from standard assumptions
- A dichotomy for local small-bias generators
- Algebraic attacks against random local functions and their countermeasures
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Batch codes and their applications
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Cryptographic hardness of random local functions. Survey
- Cryptography in \(\mathrm{NC}^0\)
- Cryptography with constant computational overhead
- Expander-Based Cryptography Meets Natural Proofs
- Fast pseudorandom functions based on expander graphs
- Fast public-key silent OT and more from constrained Naor-Reingold
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Maximum flow and minimum-cost flow in almost-linear time
- More on average case vs approximation complexity
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- New results for learning noisy parities and halfspaces
- Noise-tolerant learning, the parity problem, and the statistical query model
- Oblivious transfer with constant computational overhead
- On \(\varepsilon\)-biased generators in \(\mathrm{NC}^0\)
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- On the algebraic immunity of direct sum constructions
- On the concrete security of Goldreich's pseudorandom generator
- On the fast algebraic immunity of threshold functions
- On the one-way function candidate proposed by Goldreich
- On the Security of Goldreich’s One-Way Function
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Public-key cryptography from different assumptions
- Public-key encryption, local pseudorandom generators, and the low-degree method
- Relations between average case complexity and approximation complexity
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error
- Secure arithmetic computation with constant computational overhead
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Sublinear-communication secure multiparty computation does not require FHE
- The complexity of distributions
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
This page was built for publication: Structured-seed local pseudorandom generators and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346896)
