Compressing unit-vector correlations via sparse pseudorandom generators
From MaRDI portal
Publication:6653033
Recommendations
Cites work
- scientific article; zbMATH DE number 2009982 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- CNF-FSS and its applications
- Candidate one-way functions based on expander graphs
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Cryptographic hardness of random local functions. Survey
- Efficient Computation of the Fourier Transform on Finite Groups
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Fast public-key silent OT and more from constrained Naor-Reingold
- Function secret sharing
- Homomorphic secret sharing from lattices without FHE
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Indistinguishability obfuscation from well-founded assumptions
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- On the power of correlated randomness in secure computation
- One-message secure reductions: on the cost of converting correlations
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Prio+: privacy preserving aggregate statistics via Boolean shares
- Private database queries using somewhat homomorphic encryption
- Pseudorandom correlation functions from variable-density LPN, revisited
- Pseudorandom functions and lattices
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Succinct LWE sampling, random polynomials, and obfuscation
- Theory of Cryptography
This page was built for publication: Compressing unit-vector correlations via sparse pseudorandom generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653033)
