Meaningful Share Generation for (2, 2)-Multiple Visual Secret Sharing Scheme Without Pixel Expansion
Chao-Liang Liu, Wang‐Jui Tsai, Ting‐Yi Chang, Chun‐Cheng Peng, Peng-Shiang Wong · The Computer Journal · 2014
In (k,n)-threshold visual secret sharing (VSS) schemes, the secret holder can base a group of n participants with n shares to reconstruct secret message by stacking shares. The secret messages are identified directly without any computation with only k(k≤n) or more shares using the human eye. Recently, many researchers have devoted themselves to studying how more secret images can be encrypted into the same quantity of shares. An extended random-grid VSS scheme that can embed four secret images without pixel expansion under the (2,2)-visual secret-sharing scheme was proposed by Chen et al. The secrets can be recovered by directly stacking and rotating one of the two shares at 90°, 180° and 270°, respectively. However, the used shares are meaningless, causing the attacker to become doubtful by looking at meaningless shares and trying to steal secret messages. The meaningless shares lead to difficult encryption management. This paper proposes an improved black-and-white (2,2)-visual secret sharing scheme that adapts square shares to embed three secret images via two camouflaged images. Compared with other related VSS schemes, this technique has more flexibility, efficiency and security.