Random sequence based secret sharing of an encrypted color image

Secret sharing was first proposed by Shamir and Blakley individually. It refers to a method of distributing secret information amongst a group of individuals say n, each of whom is allocated a share of the secret information. The secret can only be reconstructed when a sufficient number of individuals' shares say k are combined together. The existing Secret sharing schemes are complex and depend on intensive mathematical calculation. Secret sharing technique has lack of security as from a sufficient number of shares secret information can easily be retrieved. In this current work we have taken a color image as a secret and have proposed a new technique called random sequence which needs very less computation for k-n secret sharing. For security purpose the image is encrypted by bit sieving with another image used as a key.