1994 | OriginalPaper | Buchkapitel
A Randomness-Rounds Tradeoff in Private Computation
verfasst von : Eyal Kushilevitz, Adi Rosén
Erschienen in: Advances in Cryptology — CRYPTO ’94
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study the role of randomness in multi-party private computations. In particular, we give several results that prove the existence of a randomness-rounds tradeoff in multi-party private computation of xor. We show that with a single random bit, Θ(n) rounds are necessary and sufficient to privately compute xor of n input bits. With d ≥ 2 random bits, Ω(log n/d) rounds are necessary, and O(log n/log d) are sufficient.More generally, we show that the private computation of a boolean function f, using d ≥ 2 random bits, requires Ω(log S(f)/d) rounds, where S(f) is the sensitivity of f. Using a single random bit, Ω(S(f)) rounds are necessary.