Sharing secret color images using cellular automata with memory

A {k,n}-threshold scheme based on two-dimensional memory cellular automata is proposed to share images in a secret way. This method allows to encode an image into n shared images so that only qualified subsets of k or more shares can recover the secret image, but any k-1 or fewer of them gain no information about the original image. The main characteristics of this new scheme are: each shared image has the same size that the original one, and the recovered image is exactly the same than the secret image; i.e., there is no loss of resolution.

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

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

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

[4]  Ramón Alonso-Sanz,et al.  Reversible cellular automata with memory: two-dimensional patterns from a single site seed , 2003 .

[5]  N. Margolus,et al.  Invertible cellular automata: a review , 1991 .

[6]  조위덕.  Cryptography , 1987, The Official (ISC)2 SSCP CBK Reference.

[7]  Puhua Guan,et al.  Cellular Automaton Public-Key Cryptosystem , 1987, Complex Syst..

[8]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[9]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[10]  Wen-Guey Tzeng,et al.  A New Approach for Visual Cryptography , 2002, Des. Codes Cryptogr..

[11]  Young-Chang Hou,et al.  Visual cryptography for color images , 2003, Pattern Recognit..

[12]  Ángel Martín del Rey,et al.  Wolfram cellular auto mata and their cryptographic use as pseudorandom bit generators , 2003 .

[13]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

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

[15]  Howard Gutowitz,et al.  Cryptography with Dynamical Systems , 1993 .

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

[17]  H.C.A. van Tilborg,et al.  A construction of a k out of n visual secret sharing scheme , 1997 .

[18]  Chang-Chou Lin,et al.  Visual cryptography for gray-level images by dithering techniques , 2003, Pattern Recognit. Lett..

[19]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[20]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[21]  Chin-Chen Chang,et al.  Sharing multiple secrets in digital images , 2002, J. Syst. Softw..

[22]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[23]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[24]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[25]  Ángel Martín del Rey,et al.  Encryption of Images with 2-dimensional Cellular Automata , 2002 .

[26]  Gonzalo Álvarez,et al.  Graphic Cryptography with Pseudorandom Bit Generators and Cellular Automata , 2003, KES.

[27]  Ja-Chen Lin,et al.  Secret image sharing , 2002, Comput. Graph..

[28]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).