An Efficient Secret Image Sharing Scheme

Abstract

This paper refers to a novel (r, n)-threshold secret image sharing scheme with low information overhead. The secret image is encoded into n noise-like shadow images in such a way that any r of the n shares can be used to reveal the secret, and no information about the secret can be revealed from any r–1 or fewer shares. The size of the shadow images is relatively small. Compared with the commonly used in the field of secret image sharing “Thien-Lin algorithm (2002),” the proposed scheme provides an alternative solution for light images. For the security analysis in the case of a 256x256 gray level secret image, if a hacker acquires any r – 1 shadow images, the hacker can construct only r – 1 equations, then the possibility of guessing the right solution is only 1/256. Hence, there are (256x256)/r polynomials, the possibility of obtaining the right image is only (1/256) (256x256)/r. The experimental results and theoretically analysis demonstrate that the proposed scheme performs well.