Abstract
According to the success of the Internet, Information security becomes an important issue to the human beings. To avoid the information is carried by only a single individual, how to share the secret information to the participants would be an important subject. According to the (k,n)-threshold scheme, the data are partitioned into n shadows which are distributed to n participants. By collecting at least k out of n shadows, we can completely recover the original data. Otherwise, we could not recover the original data. We propose a new method to improve the implementation method of Ulutas [Ulut2009] based on Chinese remainder theorem in this thesis. The advantage of our method in this thesis is that we not only simplify the method, but also guarantee the recovered image would not get distorted. Experiments for three color images are provided for demonstration.