Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1598-1606 |
| Number of pages | 9 |
| Journal | Computer Journal |
| Volume | 58 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 2015 Mar 19 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science(all)
Cite this
}
Meaningful Share Generation for (2, 2)-Multiple Visual Secret Sharing Scheme Without Pixel Expansion. / Liu, Chao Liang; Tsai, Wang Jui; Chang, Ting Yi; Peng, Chun Cheng; Wong, Peng Shiang.
In: Computer Journal, Vol. 58, No. 7, 19.03.2015, p. 1598-1606.Research output: Contribution to journal › Article
TY - JOUR
T1 - Meaningful Share Generation for (2, 2)-Multiple Visual Secret Sharing Scheme Without Pixel Expansion
AU - Liu, Chao Liang
AU - Tsai, Wang Jui
AU - Chang, Ting Yi
AU - Peng, Chun Cheng
AU - Wong, Peng Shiang
PY - 2015/3/19
Y1 - 2015/3/19
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84937029500&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937029500&partnerID=8YFLogxK
U2 - 10.1093/comjnl/bxu105
DO - 10.1093/comjnl/bxu105
M3 - Article
AN - SCOPUS:84937029500
VL - 58
SP - 1598
EP - 1606
JO - Computer Journal
JF - Computer Journal
SN - 0010-4620
IS - 7
ER -