A Randomness-Rounds Tradeoff in Private Computation
From MaRDI portal
Publication:4388979
Recommendations
Cited in
(14)- $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
- Lower and upper bounds on the randomness complexity of private computations of AND
- Privacy with Imperfect Randomness
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Private computation using a PEZ dispenser.
- A Theorem on Sensitivity and Applications in Private Computation
- A theorem on sensitivity and applications in private computation
- Randomness in Private Computations
- Lower and upper bounds on the randomness complexity of private computations of AND
- Amortizing Randomness in Private Multiparty Computations
- scientific article; zbMATH DE number 1406796 (Why is no real title available?)
- More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
- Privacy and Communication Complexity
- Tight bounds on the randomness complexity of secure multiparty computation
This page was built for publication: A Randomness-Rounds Tradeoff in Private Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388979)