(2, 3)-threshold visual cryptography for color images

Authors:
Kun-Yuan Chao;Ja-Chen Lin
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.
Venue:
ISCGAV'06 Proceedings of the 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Year:
2006

Citing 4
Cited 0

How to share a secret

Communications of the ACM
Visual cryptography for grey level images

Information Processing Letters
Visual cryptography for gray-level images by dithering techniques

Pattern Recognition Letters
New visual secret sharing schemes using probabilistic method

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the studies in visual cryptography (VC) are for binary images. Hou's method [Pattern Recog. 2003, Vol. 36, 1619-1629] is a good extension from binary to colors. In this study, we extend Hou's method further so that the new scheme has fault-tolerant ability, namely, the secret image can still be revealed if one of the generated shares delays due to communication channel failure, or by natural crash of the storage equipment, or even destroyed by hackers. In the proposed scheme, a color secret image decomposes into three shares. Each share alone cannot reveal the secret image. However, gathering "any" two of the three shares can unveil the secret image.