Lower and upper bounds on the randomness complexity of private computations of AND
From MaRDI portal
Publication:2175947
DOI10.1007/978-3-030-36033-7_15zbMath1455.94176OpenAlexW3185542553MaRDI QIDQ2175947
Eyal Kushilevitz, Rafail Ostrovsky, Damien Vergnaud, Adrian Thillard, Emmanuel Prouff, Adi Rosén
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_15
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A communication-privacy tradeoff for modular addition
- Characterizing linear size circuits in terms of privacy
- Extracting randomness: A survey and new constructions
- Randomness complexity of private computation
- On the Communication Required for Unconditionally Secure Multiplication
- Communication and Randomness Lower Bounds for Secure Computation
- A Theorem on Sensitivity and Applications in Private Computation
- Randomness in Private Computations
- A Randomness-Rounds Tradeoff in Private Computation
- Amortizing Randomness in Private Multiparty Computations
- $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
- Unconditionally Secure Computation with Reduced Interaction
- A Zero-One Law for Boolean Privacy
This page was built for publication: Lower and upper bounds on the randomness complexity of private computations of AND
