Abstract
The information security is more and more important while the internet communication grows up, so the secret image sharing technique will be a useful method to protect our secret. This technique, also called (k,n) threshold scheme, distributes secret image to n shadow images which can be preserved by n participants, and we can reveal the secret image by any more than k of the shadow images. If we only collect fewer than k shadow images, we cannot get sufficient information to reveal the secret image. In this thesis, we implement three existing secret sharing method and the proposed method. The main idea of the proposed method is based on Chinese Remainder Theorem. It needs fewer parameters than other methods but needs an additional image to ensure we can completely reveal the secret image. However, if we do not have this image, we still can reveal a very similar image.