Computer
Visual cryptography for general access structures
Information and Computation
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Constructions and Bounds for Visual Cryptography
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images
Information Security and Cryptology
Probabilistic visual secret sharing schemes for grey-scale images and color images
Information Sciences: an International Journal
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
On the security of multi-secret visual cryptography scheme with ring shares
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
| Hi-index | 0.00 |
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.