Compressing unit-vector correlations via sparse pseudorandom generators
From MaRDI portal
Publication:6653033
DOI10.1007/978-3-031-68397-8_11MaRDI QIDQ6653033
Mahimna Kelkar, Amit Agarwal, Niv Gilboa, Elette Boyle, Yuval Ishai, Yi Ping Ma
Publication date: 13 December 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Cryptographic hardness of random local functions. Survey
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Homomorphic secret sharing from lattices without FHE
- Succinct LWE sampling, random polynomials, and obfuscation
- Private Database Queries Using Somewhat Homomorphic Encryption
- Pseudorandom Functions and Lattices
- Function Secret Sharing
- Candidate One-Way Functions Based on Expander Graphs
- Efficient Computation of the Fourier Transform on Finite Groups
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the Power of Correlated Randomness in Secure Computation
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- CNF-FSS and Its Applications
- Theory of Cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Pseudorandom correlation functions from variable-density LPN, revisited
- Prio+: privacy preserving aggregate statistics via Boolean shares
- One-message secure reductions: on the cost of converting correlations
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Fast public-key silent OT and more from constrained Naor-Reingold
This page was built for publication: Compressing unit-vector correlations via sparse pseudorandom generators
