论文信息 - On the Randomness of Visual Cryptography Scheme

On the Randomness of Visual Cryptography Scheme

The randomness of visual cryptography scheme (VCS) measures at least how many random bits are required to encode a secret pixel. In this paper, the randomness of decomposition-based VCS proposed by Ateniese et al. is reduced significantly.

Wen Wang | Feng Liu | Teng Guo | YaWei Ren | Chuan Kun Wu

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

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

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

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

[5] Feng Liu,et al. Improving the visual quality of size invariant visual cryptography scheme , 2012, J. Vis. Commun. Image Represent..

[6] Shyong Jian Shyu,et al. Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes , 2011, IEEE Trans. Inf. Forensics Secur..

[7] Annalisa De Bonis,et al. Randomness in secret sharing and visual cryptography schemes , 2004, Theor. Comput. Sci..

[8] Feng Liu,et al. K out of K Extended Visual Cryptography Scheme by Random Grids , 2014, Signal Process..

[9] Mausumi Bose,et al. Optimal (k, n) visual cryptographic schemes for general k , 2010, Des. Codes Cryptogr..

[10] Feng Liu,et al. Multi-pixel Encryption Visual Cryptography , 2011, Inscrypt.

[11] Stelvio Cimato,et al. Visual cryptography schemes with optimal pixel expansion , 2006, Theor. Comput. Sci..

[12] Feng Liu,et al. Threshold visual secret sharing by random grids with improved contrast , 2013, J. Syst. Softw..

[13] Feng Liu,et al. On the Equivalence of Two Definitions of Visual Cryptography Scheme , 2012, ISPEC.