Secret image sharing (SIS) with small-sized shadow images has many benefits, such as\nsaving storage space, improving transmission time, and achieving information hiding. When adjacent\npixel values in an image are similar to each other, the secret image will be leaked when all random\nfactors of an SIS scheme are utilized for achieving small sizes of shadow images. Most of the studies\nin this area suffer from an inevitable problem: auxiliary encryption is crucial in ensuring the security\nof those schemes. In this paper, an SIS scheme with small-sized shadow images based on the Chinese\nremainder theorem (CRT) is proposed. The size of shadow images can be reduced to nearly 1/k of\nthe original secret image. By adding random bits to binary representations of the random factors in\nthe CRT, auxiliary encryption is not necessary for this scheme. Additionally, reasonable modifications\nof the random factors make it possible to incorporate all advantages of the CRT as well, including a\n(k, n) threshold, lossless recovery, and low computation complexity. Analyses and experiments are\nprovided to demonstrate the effectiveness of the proposed scheme.
Loading....