Abstract
Secret image sharing (SIS) with small-sized shadow images has many benefits, such as saving storage space, improving transmission time, and achieving information hiding. When adjacent pixel values in an image are similar to each other, the secret image will be leaked when all random factors of an SIS scheme are utilized for achieving small sizes of shadow images. Most of the studies in this area suffer from an inevitable problem: auxiliary encryption is crucial in ensuring the security of those schemes. In this paper, an SIS scheme with small-sized shadow images based on the Chinese remainder theorem (CRT) is proposed. The size of shadow images can be reduced to nearly 1 / k of the original secret image. By adding random bits to binary representations of the random factors in the CRT, auxiliary encryption is not necessary for this scheme. Additionally, reasonable modifications of the random factors make it possible to incorporate all advantages of the CRT as well, including a ( k , n ) threshold, lossless recovery, and low computation complexity. Analyses and experiments are provided to demonstrate the effectiveness of the proposed scheme.
Highlights
The security of important information transmitted over insecure communication channels is attracting increasing attention
We proposed a secret image sharing scheme with small-sized shadow images
Our scheme successfully reduces the size of the shadow images using the Chinese remainder theorem (CRT), which has been paid less attention in previous studies
Summary
The security of important information transmitted over insecure communication channels is attracting increasing attention. Previous literature has mainly focused on three aspects, including image encryption, image steganography, and secret image sharing (SIS). Image encryption was subject to the earliest research, and more advanced cryptographic methods are developing. Image steganography is the art of hiding secret information into an innocent-looking cover image. Both of these techniques create only one file to hold all secrets, which may lead to the failure of communication if this one item is lost or damaged. If duplicates are used to overcome this weakness, the danger of exposing the secret image increases. SIS [1,2] is a solution to the above risks
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
