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:
“The service a man renders his friend is trivial and selfish, compared with the service he knows his friend stood in readiness to yield him, alike before he had begun to serve his friend, and now also. Compared with that good-will I bear my friend, the benefit it is in my power to render him seems small.”
—Ralph Waldo Emerson (1803–1882)
“The secret of my influence has always been that it remained secret.”
—Salvador Dali (1904–1989)
“It is easy to see that what is best written or done by genius in the world, was no man’s work but came by wide social labor, when a thousand wrought like one, sharing the same impulse.”
—Ralph Waldo Emerson (1803–1882)