Conventional (t, n) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.
Conventional (t, n) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.
“…The essential idea is to use a polynomial function of order k -1 to construct n image shares, in which the size of each share image is only 1/k times of the original image, but the computational complexity is the same as in Samir's scheme. This work attracted many researchers to propose different techniques which are given in references [4][5][6][7]. But in [3] T h i e n and L i n proposed a method in which the pixels having a value greater that 251, are truncated into 250.…”
“…In the scheme, the size of generated shadow images is only 1/r of that of the original image, which is advantageous in subsequent storage and transmission. Following the work of Thien and Lin, certain image sharing schemes [4][5][6] have been proposed to reduce the size of the shadow images.…”
Section: Introductionmentioning
confidence: 99%
“…Wang and Su [5] designed an SIS method applying the image difference and the algorithm of Huffman coding in the sharing process. Chang et al [6] proposed a method for color images sharing with smaller shadow images.…”
In this study, a new (r, n)-threshold secret image sharing scheme with low information overhead for images is provided, which has a low distortion rate, and is more applicable for light images. A secret image is encoded into n noise-like shadow images to satisfy the condition that any r of the n shares can be used to reveal the secret image, and no information on the secret can be revealed from any r -1 or fewer shares. The size of the shadow images is relatively small. The experimental results show the effectiveness of the proposed scheme.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.