secret image sharing scheme

An implementation of secret sharing scheme on image

Secret sharing is for distributing a secret among n participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when at least t number of shares are combined together; individual shares are of no use on their own. The security of such scheme depends on the model parameter t (i.e., number of required shares for recovering the whole secret), the size of the secret and how many unique secret shares have been gained by an adversary. For example, a brutal force attack for an 8-bit secret image with size N requires the complexity of 2^{8*N/t}, if the adversary has obtained t-1 shares.