On the Security of a Visual Cryptography Scheme for Color Images

Bert W.  Leung; Felix Y.  Ng; Duncan S.  Wong

Paper 2008/223

On the Security of a Visual Cryptography Scheme for Color Images

Bert W. Leung, Felix Y. Ng, and Duncan S. Wong

Abstract

In Pattern Recognition, vol. 36, 2003, Hou proposed a four-share visual cryptography scheme for color images. The scheme splits a secret image into four shares, the black mask and the other three shares. It was claimed that without knowing the black mas, no information about the secret image can be obtained even if all the other three shares are known. In this paper, we show that this may be true for a few specific two-color secret images only. In all other cases however, security cannot be guaranteed. We show that an attacker can compromise a randomly chosen two-color secret image from any two of the other three shares with probability 4/7. The advantage will increase to 6/7 if all the other three shares are known. If the secret image has three or four colors, we show that the attacker can compromise it with probability 4/7 and 8/35, respectively. Finally, we show that our technique can be extended to compromising secret images with more than four colors.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: visual cryptography
Contact author(s): duncan @ cityu edu hk
History: 2008-05-25: received
Short URL: https://ia.cr/2008/223
License: CC BY

BibTeX

@misc{cryptoeprint:2008/223,
      author = {Bert W.  Leung and Felix Y.  Ng and Duncan S.  Wong},
      title = {On the Security of a Visual Cryptography Scheme for Color Images},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/223},
      year = {2008},
      url = {https://eprint.iacr.org/2008/223}
}