On secret sharing systems

Abstract

-A,“secret sharing,system”,permits,a secret,to be shared among n trustees in such a way that any k of them can recover the secret, but any k - 1 have complete,uncertainty,about it. A linear coding,scheme for secret sharing is exhibited which subsumes,the polynomial,interpolation method,proposed,by Shamir,and,can also he viewed,as a deterministic version of Blakley’s probabilistic method. Bounds on the maximum,value of n for a given k and secret size are derived for any system, linear or