Secret sharing is a cryptographic primitive enabling Secure Multi-Party Computation by distributing a secret among $n$ parties such that any subset of size at least $t+1$ can reconstruct the original value, while any proper subset provides zero information about it (perfect privacy). Formally defined via randomized share generation and deterministic recovery algorithms satisfying specific correctness thresholds within either commutative groups or finite fields. The concept bridges computer security theory with algebraic geometry, utilizing principles of polynomial interpolation over $\mathbb{Z}_p$ and $\text{GF}(2^k)$ to achieve information-theoretic indistinguishability guarantees that distinguish adversarial advantage in guessing challenge bits as negligible (zero for perfect schemes).
Secret sharing is a cryptographic primitive enabling Secure Multi-Party Computation by distributing a secret among $n$ parties such that any subset of size at least $t+1$ can reconstruct the original…