Trivial Secret Sharing
There are several (t, n) secret sharing schemes for t = n, when all shares are necessary to recover the secret:
- Encode the secret as an integer s. Give to each player i (except one) a random integer ri. Give to the last player the number . The secret is the sum of the players' shares.
- Encode the secret as an arbitrary length binary number s. Give to each player i (except one) a random number pi with the same length as s. Give to the last player the result of (s XOR p1 XOR p2 XOR ... XOR pi) where XOR is bitwise exclusive or. The secret is the bitwise XOR of all the players' numbers (p).
When space efficiency is not a concern, these schemes can be used to reveal a secret to any desired subsets of the players simply by applying the scheme for each subset. For example, to reveal a secret s to any two of the three players Alice, Bob and Carol, create three different (2,2) secret shares for s, giving the three sets of two shares to Alice and Bob, Alice and Carol, and Bob and Carol. This approach quickly becomes impractical as the number of subsets increases, for example when revealing a secret to any 50 of 100 players, whereas the schemes described below allow secrets to efficiently be shared with a threshold of players.
Read more about this topic: Secret Sharing
Famous quotes containing the words trivial, secret and/or sharing:
“It is pretty obvious that the debasement of the human mind caused by a constant flow of fraudulent advertising is no trivial thing. There is more than one way to conquer a country.”
—Raymond Chandler (1888–1959)
“An honest person has no secret dealings.”
—Chinese proverb.
“Eventually we will learn that the loss of indivisible love is another of our necessary losses, that loving extends beyond the mother-child pair, that most of the love we receive in this world is love we will have to share—and that sharing begins at home, with our sibling rivals.”
—Judith Viorst (20th century)