Invented independently by Adi Shamir and George Blakley in 1979, a -threshold scheme breaks a secret and shares it with individuals. While any group of or more individuals can together reconstruct the secret, no group of fewer than individuals can obtain any information at all.
- Blakley's scheme
As any -dimensional hyperplanes in intersect at a specific point, the secret may be encoded as any single coordinate of the point of intersection. Each individual secret holder is given enough information (say coefficients of the defining linear equation) to define a hyperplane; the secret is recovered by calculating the point of intersection.
- Shamir's scheme
One can fit a unique polynomial of degree to any set of points that lie on the polynomial. The scheme first creates a polynomial of degree with the secret as the first coefficient and the remaining coefficients picked at random. Then for any , gets points on the graph of the polynomial, and gives one to each of the individual secret holder. Any individuals come together will be able to determine using their shares.
Note that Shamir's scheme can be viewed as a special version of Blakley's scheme. Namely, let be the vector space of all polynomials of degree at most over . Thus, is a vector space of dimension . Let be the polynomial of degree chosen with , , picked. For any pair , set , which is an affine subspace of of dimension : if and with , then as well. Now, it is easy to see that . If we write , then . Thus, we can view as the (specially chosen) coefficients of the defining equation of the hyperplane (here are variables and , ) in .
For a large secret, one can encrypt the secret using a private key system, and then distribute the key using secret sharing.