Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
Intervenant(s) : Damien Vergnaud
(joint work with Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosen & Adrian Thillard)
We consider multi-party information-theoretic private protocols, and specifically their randomness complexity. The randomness complexity of private protocols is of interest both because random bits are considered a scarce resource, and because of the relation between that complexity measure and other complexity measures of Boolean functions such as the circuit size or the sensitivity of the function being computed. More concretely, we consider the randomness complexity of the basic Boolean function and, that serves as a building block in the design of many private protocols. We show that and cannot be privately computed using a single random bit, thus giving the first non-trivial lower bound on the 1-private randomness complexity of an explicit Boolean function. We further show that the function and, on any number of inputs n (one input bit per player), can be privately computed using 8 random bits. Together with our lower bound, we thus approach the exact determination of the randomness complexity of and. To the best of our knowledge, the exact randomness complexity of private computation is not known for any explicit function (except for xor, which is trivially 1-random, and for several degenerate functions).