Essential secret image sharing scheme with different importance of shadows

  • Authors:
  • Peng Li;Ching-Nung Yang;Chih-Cheng Wu;Qian Kong;Yanpeng Ma

  • Affiliations:
  • Department of Mathematics and Physics, North China Electric Power University, Baoding 071003 Hebei, China;Department of CSIE, National Dong Hwa University, Taiwan;Department of CSIE, National Dong Hwa University, Taiwan;Department of Mathematics and Physics, North China Electric Power University, Baoding 071003 Hebei, China;Department of Mathematics and Physics, North China Electric Power University, Baoding 071003 Hebei, China

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

In (k, n) secret image sharing (SIS), a scheme encrypts a secret image into n shadow images. Any k or more shadow images can be collaborated together to reveal the secret image. Most of the previous SIS schemes don't distinguish the importance of shadows. However, in some application environments, some participants are accorded special privileges due to their status or importance. Thus, some shadows may be more important than others. In this paper, we consider the (t, s, k, n) essential SIS (ESIS) scheme. All n shadows are classified into s essential shadows and (n-s) non-essential shadows. When reconstructing the secret image, the (t, s, k, n)-ESIS scheme needs k shadows, which should include at least t essential shadows.