$\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation

DOI10.1137/S0097539703432785zbMath1075.68061MaRDI QIDQ5317183

Anna Gál, Adi Rosén

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

lower boundsrandomnessprivate computation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Network protocols (68M12)

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 ⋮ Unnamed Item ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

This page was built for publication: $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation