Abstract
Due to the fast growth of information technology, we can get plenty of information over the Internet in time. However, some secret information cannot be released in public. Thus, information security plays an important role. A (k, n) threshold scheme for secret image sharing might be a useful method to protect a secret image. It distributes a secret image to n shadow images preserved by n participants. If we collect at least k shadow images, we can reveal the secret image. Fewer than k shadow images cannot reveal the secret image. In this thesis, based on Ulutas’s scheme [Ulut2009], we implement a useful image sharing and revealing system which uses color image as secret image and Chinese remainder theorem to reveal the secret image. The proposed method needs a necessary image to ensure that we can reveal the lossless secret image. However, if we do not use the necessary image, we can still reveal the distortion image with only the difference of the least significant bit. In the experimental results, we demonstrate the PSNR value between an original image and the revealed image is over 50 dB. It shows that the proposed approach is a simple but efficient secret image sharing approach.