A New (2, n)-Visual Threshold Scheme for Color Images

In this paper we propose a new scheme for a (2,n)-visual threshold scheme (VTS) for color images. Our scheme achieves a better color ratio than the schemes proposed by Koga et al in 1998 and 2001. The pixel expansion of our scheme is reasonably good and we also give a lower bound on the color ratio of our scheme.

[1]  Alfredo De Santis,et al.  Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.

[2]  Alfredo De Santis,et al.  Visual Cryptography for General Access Structures , 1996, Inf. Comput..

[3]  Alfredo De Santis,et al.  On the Contrast in Visual Cryptography Schemes , 1999, Journal of Cryptology.

[4]  Neal Koblitz,et al.  Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.

[5]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[6]  Hiroki Koga,et al.  New Constructions of the Lattice-Based Visual Secret Sharing Scheme Using Mixture of Colors , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[7]  Stefan Droste,et al.  New Results on Visual Cryptography , 1996, CRYPTO.

[8]  Alfredo De Santis,et al.  Constructions and Bounds for Visual Cryptography , 1996, ICALP.

[9]  Moni Naor,et al.  Visual cryptography for grey level images , 2000, Inf. Process. Lett..

[10]  Hirosuke Yamamoto,et al.  Proposal of a lattice-based visual secret sharing scheme for color and gray-scale images , 1998 .

[11]  Moni Naor,et al.  Visual Cryptography , 1994, Encyclopedia of Multimedia.