1 problem

Let $k\geq 3$ be the number of players, and let $f:(\{0,1\}^n)^k\rightarrow\{0,1\}$ be any function. A $k$-player private simultaneous messages protocol for $f$ is said to have com…