A Theorem on Sensitivity and Applications in Private Computation
From MaRDI portal
Publication:3149875
DOI10.1137/S0097539701385296zbMath1041.68065MaRDI QIDQ3149875
Publication date: 29 September 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Cryptography (94A60)
Related Items (3)
Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
This page was built for publication: A Theorem on Sensitivity and Applications in Private Computation