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 sometimes the threshold scheme is used where any of the parts are sufficient to reconstruct the original secret.
Read more about Shamir's Secret Sharing: Mathematical Definition, Shamir's Secret-sharing Scheme, Properties, See Also
Famous quotes containing the words shamir, secret and/or sharing:
“Should there be maniacs who raise the idea, they will encounter an iron fist which will leave no trace of such attempts.”
—Yitzhak Shamir (b. 1915)
“I know we’re not saints or virgins or lunatics; we know all the lust and lavatory jokes, and most of the dirty people; we can catch buses and count our change and cross the roads and talk real sentences. But our innocence goes awfully deep, and our discreditable secret is that we don’t know anything at all, and our horrid inner secret is that we don’t care that we don’t.”
—Dylan Thomas (1914–1953)
“To see ourselves as others see us can be eye-opening. To see others as sharing a nature with ourselves is the merest decency. But it is from the far more difficult achievement of seeing ourselves amongst others, as a local example of the forms human life has locally taken, a case among cases, a world among worlds, that the largeness of mind, without which objectivity is self- congratulation and tolerance a sham, comes.”
—Clifford Geertz (b. 1926)