資料載入中.....
|
請使用永久網址來引用或連結此文件:
https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/75955
|
| 題名: | Progressive Visual Cryptography With Unexpanded Shares |
| 作者: | Hou, Young-Chang;Quan, Zen-Yu |
| 貢獻者: | 淡江大學資訊管理學系 |
| 關鍵詞: | Progressive visual cryptography;secret sharing
visual cryptography |
| 日期: | 2011-11 |
| 上傳時間: | 2012-04-26 15:17:24 (UTC+8) |
| 出版者: | Piscataway: Institute of Electrical and Electronics Engineers |
| 摘要: | The basic (k, n)-threshold visual cryptography scheme is to share a secret image with n participants. The secret image can be recovered while stacking k or more shares obtained; but we will get nothing if there are less than k pieces of shares being overlapped. On the other hand, progressive visual cryptography can be utilized to recover the secret image gradually by superimposing more and more shares. If we only have a few pieces of shares, we could get an outline of the secret image; by increasing the number of the shares being stacked, the details of the hidden information can be revealed progressively. Previous researches, such as Jin and Fang & Lin, were all based upon pixel-expansion, which causes the waste of storage space and transmission time. Furthermore, Fang & Lin’s research had a severe security problem that will disclose the secret information on each share. In this paper we proposed a brand new sharing scheme of progressive visual cryptography to produce pixel-unexpanded shares. In our research the possibility for either black or white pixels of the secret image to appear as black pixels on the shares is the same, which approximates to 1/n. Therefore no one can obtain any hidden information from a single share, hence ensures the security. When superimposing k (sheets of share, the possibility for the white pixels being stacked into black pixels remains 1/n, while the possibility rises to k/n for the black pixels, which sharpens the contrast of the stacked image and the hidden information therefore become more and more obvious. After superimposing all of the shares, the contrast rises to (n-1)/n which is apparently better than the traditional ways that can only obtain 50% of contrast, consequently a clearer recovered image can be achieved. |
| 關聯: | IEEE Transactions on Circuits and Systems for Video Technology 21(11), pp.1760-1764 |
| DOI: | 10.1109/TCSVT.2011.2106291 |
| 顯示於類別: | [資訊管理學系暨研究所] 期刊論文
|
文件中的檔案:
| 檔案 |
描述 |
大小 | 格式 | 瀏覽次數 |
|---|
| index.html | | 0Kb | HTML | 307 | 檢視/開啟 | | index.html | | 0Kb | HTML | 95 | 檢視/開啟 | | Progressive Visual Cryptography With Unexpanded Shares.pdf | | 530Kb | Adobe PDF | 1 | 檢視/開啟 |
|
在機構典藏中所有的資料項目都受到原著作權保護.
|
