資料載入中.....
|
請使用永久網址來引用或連結此文件:
https://irlib.pccu.edu.tw/handle/987654321/2735
|
| 題名: | An optimization model for visual cryptography schemes with unexpanded shares |
| 作者: | Hsu, Ching-Sheng;Tu, Shu-Fen;Hou, Young-Chang |
| 貢獻者: | 資管系 |
| 日期: | 2006 |
| 上傳時間: | 2009-11-16 11:59:12 (UTC+8) |
| 摘要: | Visual cryptography schemes encrypt a secret image into n shares so that any qualified set of shares enables one to visually decrypt the hidden secret; whereas any forbidden set of shares cannot leak out any secret information. In the study of visual cryptography, pixel expansion and contrast are two important issues. Since pixel-expansion based methods encode a pixel to many pixels on each share, the size of the share is larger than that of the secret image. Therefore, they result in distortion of shares and consume more storage space. In this paper, we propose a method to reach better contrast without pixel expansion. The concept of probability is used to construct an optimization model for general access structures, and the solution space is searched by genetic algorithms. Experimental result shows that the proposed method can reach better contrast and blackness of black pixels in comparison with Ateniese et al.'s. |
| 關聯: | FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS Book Series: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Volume: 4203 Pages: 58-67 |
| 顯示於類別: | [資訊管理學系暨資訊管理研究所 ] 期刊論文
|
在CCUR中所有的資料項目都受到原著作權保護.
|
