An Optimization Model for Visual Cryptography Schemes with Unexpanded Shares
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.
KeywordsAccess Structure Secret Image Secret Information Black Pixel White Pixel
Unable to display preview. Download preview PDF.
- 4.Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Constructions and Bounds for Visual Cryptography. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 416–428. Springer, Heidelberg (1996)Google Scholar
- 6.Hou, Y.C., Tu, S.F.: A Visual Cryptographic Technique for Chromatic Images Using Multi-Pixel Encoding Method. Journal of Research and Practice in Information Technology 37(2), 179–191 (2005)Google Scholar
- 7.Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)Google Scholar