Secret color images sharing schemes based on XOR operation

This paper presents two new constructions for the secret color images sharing schemes .One is a (n, n) threshold scheme, which can be constructed based on XOR operation. The other is a (2, n) threshold scheme, which can be constructed by using AND and XOR operations. The two schemes have no pixel expansion, and the time complexity for constructing shared images is O(k1n), excluding the time needed for generating n distinct random matrices (here k1 is the size of the shared image). The reconstructed images can be obtained in the two schemes by using the XOR operation alone. The relative differences of the two schemes are 1 and 1/2, respectively. The time complexity of the recovered images is O(k1n) and O(2k1), respectively. The two schemes also provide perfect secrecy.

[1]  Moni Naor,et al.  Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions , 1999, J. Comput. Syst. Sci..

[2]  Avishek Adhikari,et al.  A New Visual Cryptographic Scheme Using Latin Squares , 2004 .

[3]  Takeru Ishihara,et al.  A Visual Secret Sharing Scheme for Color Images Based on Meanvalue-Color Mixing , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[4]  Eric R. Verheul,et al.  Constructions and Properties of k out of n Visual Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

[5]  Alfredo De Santis,et al.  Extended capabilities for visual cryptography , 2001, Theor. Comput. Sci..

[6]  Ja-Chen Lin,et al.  Sharing and hiding secret images with size constraint , 2004, Pattern Recognit..

[7]  Manuel Blum,et al.  A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..

[8]  Stelvio Cimato,et al.  Contrast optimal colored visual cryptography schemes , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[9]  Hans Ulrich Simon,et al.  Contrast-optimal k out of n secret sharing schemes in visual cryptography , 1997, Theor. Comput. Sci..

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

[11]  Ching-Nung Yang,et al.  A Note on Efficient Color Visual Encryption , 2002, J. Inf. Sci. Eng..

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

[13]  Chin-Chen Chang,et al.  Sharing Secret Omages using Shadow Codebooks , 1998, Inf. Sci..

[14]  Annalisa De Bonis,et al.  Improved Schemes for Visual Cryptography , 2001, Des. Codes Cryptogr..

[15]  Z. T. vyhověno,et al.  X 1 , 1988 .

[16]  Chris Arney.  Making, Breaking Codes: An Introduction to Cryptology , 2006 .