Use Shamir's secret sharing over the finite field . The Chair independently chooses from the uniform distribution on a finite set and forms the random polynomial
Choose distinct nonzero , with equal to the number of discs to be issued, and inscribe on disc .
Any discs give distinct values of a polynomial of degree at most . Their Vandermonde determinant is nonzero, so polynomial interpolation recovers uniquely and hence recovers the secret as .
Conversely, fix any observed discs and any candidate secret . Interpolating through those points and gives exactly one polynomial of degree at most . Thus every candidate is compatible with the observed discs in exactly the same number of ways. Because the coefficients were chosen uniformly, the conditional distribution of the secret is unchanged after seeing any discs. This proves the Perfect secrecy of Shamir's threshold scheme.
Shamir's secret sharing Created 2026-09-29 Updated 2026-11-05
Shamir's secret sharing distributes a secret in a finite field so that any of shares recover it, while fewer than shares reveal no information about it. Choose , distinct nonzero field elements , and independent uniformly distributed coefficients , independent of . Set
and give participant the pair . Any shares determine by polynomial interpolation, hence determine . Fewer than shares have a distribution independent of ; this is Perfect secrecy of Shamir's threshold scheme.[ref]
For example, over the finite field , a two-share threshold with secret and coefficient gives . The shares and recover and . Either share alone is compatible with every secret, and the uniform choice of makes its distribution independent of that secret.