POB Number System Based Multi-Image Secret Sharing

Secret sharing is the methodology in which secret is broken into multiple pieces called shares, therefore to recover back this secret, all the n shares or a subset of the shares are required. The advantage of this form of encryption being that individual shares cannot reveal any useful information. First of such attempts where made by Adi Shamir and George Blakely, who individually, were successfully able to implement this scheme. Since that period a consist advancement has been marked, the recent being executed upon multimedia data for secure storage and processing. A need for such encryption schemes are necessary in today's environment where majority of highly confidential and valuable data is stored online on cloud storage or other distributed environments. Also the need to secure the data, along with allowing it to be processed in the encrypted state is also necessary. Therefore in this paper an encryption scheme based on a POB Number System upon multiple images has been proposed. It splits the images into multiple shares and further increases its security by creating an inter-dependency among them. The final shares obtained are secure and reveal no information.