How to Share a Secret
- Let S be some secret. A collection of n people Ej share this secret in such a way that
each Ej knows some information xj,
for a certain fixed integer k, 2≤k≤n, the knowledge of any k of th x’s enables to find S easily,
the knowlegde of less than k of the x’s leaves S undetermined.
This problem was considered first by A. Shamir  and he calls such a scheme a (k, n) threshold scheme.
Unable to display preview. Download preview PDF.