Randomness complexity of private computation
From MaRDI portal
Recommendations
- On the number of random bits in totally private computation
- $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
- Randomness in Private Computations
- scientific article; zbMATH DE number 1759657
- Lower and upper bounds on the randomness complexity of private computations of AND
Cited in
(18)- Randomness in private sequential stateless protocols
- scientific article; zbMATH DE number 1759657 (Why is no real title available?)
- scientific article; zbMATH DE number 7559107 (Why is no real title available?)
- Tight bounds on the randomness complexity of secure multiparty computation
- On the communication required for unconditionally secure multiplication
- Randomness-efficient non-interactive zero knowledge
- $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
- Privacy and Communication Complexity
- Lower and upper bounds on the randomness complexity of private computations of AND
- A theorem on sensitivity and applications in private computation
- Multi-party protocols, information complexity and privacy
- A Theorem on Sensitivity and Applications in Private Computation
- On the number of random bits in totally private computation
- Random sources in private computation
- Lower and upper bounds on the randomness complexity of private computations of AND
- Binary decompositions of probability densities and random-bit simulation
- VSS Made Simpler
- Randomness in Private Computations
This page was built for publication: Randomness complexity of private computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961058)
