Sharing more information in gray visual cryptography scheme

  • Authors:
  • Peng Li;Ching-Nung Yang;Qian Kong;Yanpeng Ma;Zheng Liu

  • Affiliations:
  • Department of Mathematics and Physics, North China Electric Power University, Baoding, Hebei, China;Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 974, Taiwan;Department of Mathematics and Physics, North China Electric Power University, Baoding, Hebei, China;Department of Mathematics and Physics, North China Electric Power University, Baoding, Hebei, China;Department of Mathematics and Physics, North China Electric Power University, Baoding, Hebei, China

  • Venue:
  • Journal of Visual Communication and Image Representation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Visual cryptography scheme (VCS) shares a binary secret image into several binary shadows, and the secret image can be visually revealed by stacking qualified shadows without computation. From the point of view of sharing secret information, VCS is not efficiency because of the large size expansion and low visual quality. In this paper, we introduce a general gray visual cryptography scheme, which can share more information, called Sharing More Information Gray Visual Cryptography Scheme (SMIGVCS). All the shadow pixels of VCS embed additional information to generate gray shadows of SMIGVCS, and the embedded information comes from the shadows of a polynomial-based secret sharing scheme (PSSS). In the revealing process, a vague secret image is visually decoded by stacking qualified shadows, and more information is revealed by computation. Compared with the two-in-one image secret sharing scheme (TiOISSS), our SMIGVCS can achieve smaller shadow size with acceptable visual quality.