An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares

doi:10.1007/11875604_8

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 期刊論文 > Item 987654321/21319

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21319

題名:	An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares
作者:	Hsu, Ching-Sheng;Tu, Shu-Fen;Hou, Young-Chang
貢獻者:	淡江大學資訊管理學系
關鍵詞:	Data privacy;Data storage equipment;Genetic algorithms;Optimization;Set theory;Visual communication;Optimization model;Pixels;Secret images;Visual cryptography;Cryptography
日期:	2006
上傳時間:	2013-03-12 11:03:39 (UTC+8)
出版者:	Heidelberg: Springer
摘要:	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.
關聯:	Lecture Notes in Computer Science 4203, pp.58-67
DOI:	10.1007/11875604_8
顯示於類別:	[資訊管理學系暨研究所] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	102	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....