Shamir's Secret Sharing

From Wikipedia, the free encyclopedia

Shamir's Secret Sharing is an algorithm in cryptography. It is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part, where some of the parts or all of them are needed in order to reconstruct the secret.

Counting on all participants to combine together the secret might be impractical, and therefore we may use the threshold scheme, as demonstrated by Liu's problem: "11 scientists are working on a secret project. They wish to lock up the documents in a cabinet so that the cabinet can be opened if and only if 6 or more of the scientists are present".

Contents

[edit] Mathematical definition

Formally, our goal is to divide some data D (e.g., the safe combination) into n\,\! pieces D_1,\cdots,D_n\,\! in such a way that:

  1. Knowledge of any k\,\! or more D_i\,\! pieces makes D\,\! easily computable.
  2. Knowledge of any k-1\,\! or fewer D_i\,\! pieces leaves D\,\! completely undetermined (in the sense that all its possible values are equally likely).

This scheme is called \left(k,n\right)\,\! threshold scheme. If k=n\,\! then all participants are required together to reconstruct the secret.

[edit] Shamir's secret-sharing scheme

The essential idea of Adi Shamir's threshold scheme is that 2 points are sufficient to define a line, 3 points are sufficient to define a parabola, 4 points to define a cubic curve and so forth. That is, it takes n+1\,\! points to define a polynomial of degree n\,\!.

Suppose we want to use \left(k,n\right)\,\! threshold scheme to share our secret S\,\! (without loss of generality, some number) where k<n\,\!. The decision of values for k\,\! and n\,\! controls the strength of the system.

Choose at random \left(k-1\right)\,\! coefficients a_1,\cdots,a_{k-1}\,\!, and let a_0=S\,\!. Build polynomial f\left(x\right)=a_0+a_1x+a_2x^2+a_3x^3+\cdots+a_{k-1}x^{k-1}\,\!. Let us construct any n\,\! points out of it, for instance set i=1,\cdots,n\,\! to retrieve \left(i,f\left(i\right)\right)\,\!. Every participant is given a point (a pair of input to the polynomial and output). Given any subset of k\,\! of these pairs, we can find the coefficients of the polynomial by polynomial curve fitting, and then evaluate a_0\,\!, which is the secret.

[edit] Usage

[edit] Example

[edit] Preparation

Suppose that our secret is our ATM code: 1234 (S=1234)\,\!.

We wish to divide the secret into 6 parts (n=6)\,\!, where any subset of 3 parts (k=3)\,\! is sufficient to reconstruct the secret. At random we obtain 2 numbers: 166, 94.

(a_1=166;a_2=94)\,\!

Our polynomial to produce secret shares (points) is therefore:

f\left(x\right)=1234+166x+94x^2\,\!

We construct 6 points from the polynomial:

\left(1,1494\right);\left(2,1942\right);\left(3,2578\right);\left(4,3402\right);\left(5,4414\right);\left(6,5614\right)\,\!

We give each participant a different single point (both x\,\! and f\left(x\right)\,\!).

[edit] Reconstruction

In order to reconstruct the secret any 3 points will be enough.

Let us consider \left(x_0,y_0\right)=\left(2,1942\right);\left(x_1,y_1\right)=\left(4,3402\right);\left(x_2,y_2\right)=\left(5,4414\right)\,\!.

We will compute Lagrange basis polynomials:

\ell_0=\frac{x-x_1}{x_0-x_1}\cdot\frac{x-x_2}{x_0-x_2}=\frac{x-4}{2-4}\cdot\frac{x-5}{2-5}=\frac{1}{6}x^2-1\frac{1}{2}x+3\frac{1}{3}\,\!

\ell_1=\frac{x-x_0}{x_1-x_0}\cdot\frac{x-x_2}{x_1-x_2}=\frac{x-2}{4-2}\cdot\frac{x-5}{4-5}=-\frac{1}{2}x^2+3\frac{1}{2}x-5\,\!

\ell_2=\frac{x-x_0}{x_2-x_0}\cdot\frac{x-x_1}{x_2-x_1}=\frac{x-2}{5-2}\cdot\frac{x-4}{5-4}=\frac{1}{3}x^2-2x+2\frac{2}{3}\,\!

Therefore

f(x)=\sum_{j=0}^2 y_j\cdot\ell_j(x)\,\!

=1942\cdot\left(\frac{1}{6}x^2-1\frac{1}{2}x+3\frac{1}{3}\right)+3402\cdot\left(-\frac{1}{2}x^2+3\frac{1}{2}x-5\right)+4414\cdot\left(\frac{1}{3}x^2-2x+2\frac{2}{3}\right)\,\!

=1234+166x+94x^2\,\!

Recall that the secret is the free coefficient, which means that S=1234\,\!, and we are done.

[edit] Properties

Some of the useful properties of Shamir's \left(k,n\right)\,\! threshold scheme are:

  1. Secure: Information theoretic security.
  2. Minimal: The size of each piece does not exceed the size of the original data.
  3. Extensible: When k\,\! is kept fixed, D_i\,\! pieces can be dynamically added or deleted (e.g., when scientists are fired or suddenly die) without affecting the other pieces.
  4. Dynamic: Security can be easily enhanced without changing the secret, but by changing the polynomial occasionally (keeping the same free term) and constructing new shares to the participants.
  5. Flexible: In organizations where hierarchy is important, we can supply each participant different number of pieces according to his importance inside the organization. For instance, the president can unlock the safe alone, whereas 3 secretaries are required together to unlock it.

[edit] See also

[edit] References

  • Liu, C. L. (1968), Introduction to Combinatorial Mathematics, New York: McGraw-Hill .
  • Dawson, E. & Donovan, D. (1994), “The breadth of Shamir's secret-sharing scheme”, Computers & Security 13: 69–78 .

[edit] External links

Languages