A Randomness-Rounds Tradeoff in Private Computation

DOI10.1137/S089548019427634XzbMath0907.68101OpenAlexW2013784340MaRDI QIDQ4388979

Eyal Kushilevitz, Adi Rosén

Publication date: 11 May 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548019427634x

zbMATH Keywords

sensitivitylower boundsrandomnessprivate distributed computations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Distributed algorithms (68W15)

Related Items (4)

Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Private computation using a PEZ dispenser. ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

This page was built for publication: A Randomness-Rounds Tradeoff in Private Computation