4 Perfect secrecy
Fix \(k\) parties with points \(x_0, \dots , x_{k-1} \in F\).
Suppose that \(\mathrm{sh}_s(a) = \mathrm{sh}_s(b)\). Then \(p_{s,a}\) and \(p_{s,b}\) agree at the \(k\) points \(x_j\), and at \(0\), where both equal \(s\) (Lemma 2.3); since the \(x_j\) are nonzero, these are \(k + 1\) distinct points. The difference \(p_{s,a} - p_{s,b}\) has degree less than \(k + 1\) (Lemma 2.4) and \(k + 1\) roots, so it is zero. By Lemma 2.5, \(a_j\) and \(b_j\) are the coefficients of \(X^{j+1}\) in the same polynomial, so \(a = b\).
An injective map from a finite set to itself is bijective.
A bijection of a finite set onto itself maps the uniform distribution to the uniform distribution: each \(v \in F^k\) has exactly one preimage, so it has probability \(|F|^{-k}\).
Both are the uniform distribution, by Theorem 4.4.
The hypothesis that the points are nonzero cannot be dropped: a party with the point \(0\) receives \(p_{s,a}(0) = s\) itself.