International Journal of Advances in Computer Science and Its Applications
Author(s) : BHASKAR MONDAL, DEEP SINHA, NAVIN KUMAR GUPTA, NISHANT KUMAR, PANKAJ GOYAL
In this paper, we propose a novel (n,n) secret image sharing scheme. Both the construction and revealing of shares are based on matrix addition. In this paper, we have analyzed the secret image sharing scheme proposed by Dong and Ku  and improved it. The method  was applicable only for square images. The shares generated for a complete black image were themselves completely black; they were not random which made it a (1, n) secret sharing scheme. In case of images having completely single color other than the color black, the shares were having strip patterns rather than being random. Our proposed scheme is applicable for any size of image, has no pixel expansion and can reconstruct the secret image precisely. Our scheme includes no matrix multiplication for construction of shares, rather works on simple matrix addition which reduces the computational complexity. The scheme can be directly applied for any of the binary, grayscale or color image. Experimental results show that our scheme is simple and effective.