A Weighted Secret Image Sharing Technology
碩士 === 玄奘大學 === 資訊科學學系碩士班 === 97 === A (t,n) secret image sharing scheme shares an image into n shared images for n participants and the original secret image can be reconstructed by t shared images. Every participant have same weighted sharing image in conventional secret image sharing scheme. Howe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69041445336191152136 |
| Summary: | 碩士 === 玄奘大學 === 資訊科學學系碩士班 === 97 === A (t,n) secret image sharing scheme shares an image into n shared images for n participants and the original secret image can be reconstructed by t shared images. Every participant have same weighted sharing image in conventional secret image sharing scheme. However, secret a image with different weight is always needed. Therefore, the thesis proposes a secret image sharing technology based on Chinese Remainder Theorem with differenctly weighted sharing image. Important participant has larger importance and sharing image size. The secret image can be reconstructed if we gather sharing images with total weights larger than the threshold value. Experiment results show that our scheme can be applied to all weights combination in shared images and the secret image can be losslessly reconstructed.
|
|---|