| Summary: | 碩士 === 玄奘大學 === 資訊科學學系碩士班 === 95 === A secret sharing scheme divides an important secret message to n shares for each participant. The important secret message cannot be reconstructed when we collect less than threshold shares, say t shares. That is, anyone observes no information about the secret message from only one share. A multi-secret sharing approach lets one participant reconstruct many secret messages from only one share. In this paper, we propose three methods for sharing digital images. In the first method, we can perfectly reconstruct the secret image. The second method can reconstruct many secret images when each participant only preserves one share. However, the reconstructed image is slightly different with the source image. In the third method, we adopt hash function to propose a multistage secret image sharing that the reconstructed image is consistent with the source image. Experimental results show that the proposed approach can reduce the possessing load efficiently but secure enough.
|
|---|
