| Summary: | 碩士 === 國立清華大學 === 資訊工程學系所 === 106 === For the reason that the rapid growth of information in the era of Big Data nowadays, information security plays an important role. To avoid secret information carried by single carrier, this thesis studied image sharing based on (k,n)-threshold scheme, which distributes a secret image to n shadow images preserved by n participants. Collect at least k of them, we can recover the secret image, but fewer than k of them could not.
We proposed a method for the extension of Chuang’s scheme [Chua2016] based on Chinese Remainder Theorem in this thesis. Compared to other image sharing methods, our method is much simpler and efficient. Although the recovered image in our method has the difference of the least significant bit with the secret image, the experimental result shows that human beings can hardly distinguish two pictures with PSNR value over 50db. Moreover, we can additionally process the least significant bit of each pixel during the sharing and recovering parts if we want to recover the image completely.
|
|---|
