An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares

doi:10.1007/11875604_8

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Journal Article > Item 987654321/21319

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21319

Title:	An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares
Authors:	Hsu, Ching-Sheng;Tu, Shu-Fen;Hou, Young-Chang
Contributors:	淡江大學資訊管理學系
Keywords:	Data privacy;Data storage equipment;Genetic algorithms;Optimization;Set theory;Visual communication;Optimization model;Pixels;Secret images;Visual cryptography;Cryptography
Date:	2006
Issue Date:	2013-03-12 11:03:39 (UTC+8)
Publisher:	Heidelberg: Springer
Abstract:	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.
Relation:	Lecture Notes in Computer Science 4203, pp.58-67
DOI:	10.1007/11875604_8
Appears in Collections:	[Graduate Institute & Department of Information Management] Journal Article

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	98	View/Open

Loading...