Secret sharing (also called secret splitting) refers to method for distributing a secret amongst a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number, of possibly different types, of shares are combined together; individual shares are of no use on their own.
In one type of secret sharing scheme there is one dealer and n players. The dealer gives a share of the secret to the players, but only when specific conditions are fulfilled will the players be able to reconstruct the secret from their shares. The dealer accomplishes this by giving each player a share in such a way that any group of t (for threshold) or more players can together reconstruct the secret but no group of fewer than t players can. Such a system is called a (t, n)-threshold scheme (sometimes it is written as an (n, t)-threshold scheme).
Secret sharing was invented independently by Adi Shamir and George Blakley in 1979.
Read more about Secret Sharing: Importance of Secret Sharing Schemes, An Example Secret Sharing Scheme, Limitations of Secret Sharing Schemes, Trivial Secret Sharing, A t ≠ N Example, Shamir's Scheme, Blakley's Scheme, Using The Chinese Remainder Theorem, Proactive Secret Sharing, Verifiable Secret Sharing, Computationally Secure Secret Sharing, Other Uses and Applications
Famous quotes containing the words secret and/or sharing:
“The secret of the illusoriness is in the necessity of a succession of moods or objects. Gladly we would anchor, but the anchorage is quicksand.”
—Ralph Waldo Emerson (1803–1882)
“The traditional American husband and father had the responsibilities—and the privileges—of playing the role of primary provider. Sharing that role is not easy. To yield exclusive access to the role is to surrender some of the potential for fulfilling the hero fantasy—a fantasy that appeals to us all. The loss is far from trivial.”
—Faye J. Crosby (20th century)