An optimization model for visual cryptography schemes with unexpanded shares

CCUR > College of Business > Department of Information Management & Graduate Institute of Information Management > periodical articles > Item 987654321/2735

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/2735

Title:	An optimization model for visual cryptography schemes with unexpanded shares
Authors:	Hsu, Ching-Sheng;Tu, Shu-Fen;Hou, Young-Chang
Contributors:	資管系
Date:	2006
Issue Date:	2009-11-16 11:59:12 (UTC+8)
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:	FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS Book Series: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Volume: 4203 Pages: 58-67
Appears in Collections:	[Department of Information Management & Graduate Institute of Information Management] periodical articles

Files in This Item:

There are no files associated with this item.