An threshold secret-sharing scheme issues shares: every collection of at least shares reconstructs the secret, while every collection of fewer than shares has a distribution independent of the secret.
Shamir's secret sharing distributes a secret in a finite field so that any of shares recover it, while fewer than shares reveal no information about it. Choose , distinct nonzero field elements , and independent uniformly distributed coefficients , independent of . Set
and give participant the pair . Any shares determine by polynomial interpolation, hence determine . Fewer than shares have a distribution independent of ; this is Perfect secrecy of Shamir's threshold scheme.[ref]
For example, over the finite field , a two-share threshold with secret and coefficient gives . The shares and recover and . Either share alone is compatible with every secret, and the uniform choice of makes its distribution independent of that secret.
In Shamir's secret sharing, observing any shares leaves the secret's prior distribution unchanged. In particular, the posterior distribution is uniform if the prior distribution was uniform; uniformity of the secret is not required for perfect secrecy.
To prove this, fix distinct nonzero evaluation points and a candidate secret . The evaluations impose independent linear equations on the random coefficients. The evaluation matrix has rank : its first columns form a Vandermonde matrix multiplied by a nonsingular diagonal matrix of nonzero evaluation points. Every observed share tuple therefore has exactly compatible coefficient tuples. Since the coefficients were independently uniform, its conditional probability is
independent of . Thus the shares and the secret are independent random variables, which proves perfect secrecy.[ref]

Articles by others on the same topic (0)

There are currently no matching articles.