Paper 2004/287

Almost Ideal Contrast Visual Cryptography with Reversing

Duong Quang Viet and Kaoru Kurosawa

Abstract

A drawback of visual cryptography schemes (VCS) is much loss of contrast in the reconstructed image. This paper shows a new paradigm of VCS in which the original image is almost perfectly reconstructed. A very simple non-cryptographic operation is assumed, reversing black and white, which many copy machines have these days. We first show a $(k,n)$-VCS with {\it reversing} such that white pixels are almost perfectly reconstructed in addition to the perfect reconstruction of black pixels. The proposed scheme is fully compatible with traditional VCS in the following sense: Even if we do not have a copy machine as described above, we can reconstruct the secret image $I$ exactly in the same way as in the underlying VCS. In other words, we use a copy machine as a hedge to obtain better contrast. We next show how to convert a perfect {\it black} $(k,n)$-VCS (with reversing) into a perfect {\it white} $(k,n)$-VCS with reversing. Thirdly, we show a perfect black VCS for any monotone access structure. Finally, we show applications of our idea to colored VCS and grey level VCS, respectively.

Metadata
Available format(s)
PDF PS
Category
Secret-key cryptography
Publication info
Published elsewhere. A preliminary version of this paper was presented at CT-RSA 2004 and appeared in LNCS 2964
Keywords
visual cryptographyreversingideal contrastperfect black
Contact author(s)
viet @ nict go jp
History
2004-11-04: received
Short URL
https://ia.cr/2004/287
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/287,
      author = {Duong Quang Viet and Kaoru Kurosawa},
      title = {Almost Ideal Contrast Visual Cryptography with Reversing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/287},
      year = {2004},
      url = {https://eprint.iacr.org/2004/287}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.