Yet Another Friendly Progressive Visual Secret Sharing Scheme

Visual secret sharing (VSS) schemes, providing secret communication services, are classified into two categories: visual-cryptography-based (VC) and random-grids-based (RG). As a friendly progressive version of VC-based VSS presented in 2008, it suffers the problem of pixel expansion which is innate deficiency of conventional VC-based VSS. In this paper, a new friendly progressive VSS scheme by random grids is proposed without this problem. To demonstrate the feasibility, the experimental results show the proposed scheme does work.

[1]  Shyong Jian Shyu,et al.  Image encryption by random grids , 2007, Pattern Recognit..

[2]  Zhi Zhou,et al.  Halftone visual cryptography , 2006, IEEE Transactions on Image Processing.

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

[4]  Shyong Jian Shyu,et al.  Image encryption by multiple random grids , 2009, Pattern Recognit..

[5]  Mohan S. Kankanhalli,et al.  Progressive color visual cryptography , 2005, J. Electronic Imaging.

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

[7]  Gwoboa Horng,et al.  On generating meaningful shares in visual secret sharing scheme , 2008 .

[8]  E. Keren,et al.  Encryption of pictures and shapes by random grids. , 1987, Optics letters.

[9]  W. -P. Fang,et al.  Progressive viewing and sharing of sensitive images , 2006, Pattern Recognition and Image Analysis.

[10]  Tzung-Her Chen,et al.  Visual secret sharing by random grids revisited , 2009, Pattern Recognit..

[11]  Wen-Pinn Fang,et al.  Friendly progressive visual secret sharing , 2008, Pattern Recognit..