Speaker: K. Chen 2011.4.21 A novel authenticatable color visual secret sharing scheme using non-expanded meaningful shares D-C Lou, H-H Chen, H-C Wu, C-S Tsai, Displays, 2011 IF=0.812
Jan 03, 2016
Speaker: K. Chen
2011.4.21
A novel authenticatable color visual secret sharing scheme using non-
expanded meaningful shares
D-C Lou, H-H Chen, H-C Wu, C-S Tsai, Displays, 2011
IF=0.812
The proposed scheme simultaneously achieves the specialties of1. meaningful share images2. no pixel expansion3. the more quantity of hiding extra
confidential image4. applying to share color secret image5. providing authentication ability
Schemes Encryptionmethod
Non-expansion
Meaningfulshares
Share colorsecret
VerificationAbility
Naor & Shamir(1994)
Codebook No No No No
Chang et. al.(2008)
P. S. Yes Yes No No
Fang & Lin (2006) Codebook Yes No No Yes
Yang (2004) Prob. Yes No No No
Wang et. al. (2009)
E. D. No Yes No No
Zhang (2008) Codebook Yes No Yes No
Tu & Hou (2007) Codebook Yes No No No
Chen & Tsao (2009)
R. G. Yes No No No
Wu et.al. (2008) Codebook No Yes Yes No
Chen et.al. (2009) R. G. Yes Yes Yes No
The proposed scheme
P. S. Yes Yes Yes Yes
Related works
P.S. = Pixel swapping, Prob. = Probabilistic method, R. G. = Random grids
Visual cryptography with extra ability of hiding confidential data
W. P. Fang, J. C. Lin, Journal of Electronic Imaging, 2006
New data hiding scheme using pixel swapping for halftone images
Y. F. Chang, J. B. Feng, C.S. Tsai, Y. P. Chu, H. C. Syu, The Imaging Science Journal, 2008
Related works
Visual cryptography with extra ability of hiding confidential data
v
uShare BShare A
Ä =
Ä =If s = white then “same”
If s = black then “complement”
S1 S2S1 S2S1
New data hiding scheme using pixel swapping for halftone images
New data hiding scheme using pixel swapping for halftone images
疊合的點是白點 ( 若是黑點就沒必要調整 )
要調整的點和機密不同 ( 若是相同就沒必要調整 )
找一個和要調整不同的點 ( 找個能顯示機密的點 )
該點不能太遠
防止邊緣洩密
Ha Hb S
Ha + BB
The proposed scheme (1)
1. divide the two cover images Ha, Hb and secret image S into several non-overlapping 22 blocks
2. calculate the number of black pixels in each 22 block of the cover images, then determine the block M and F by the following
3. if there exists a pixel Mmn, in the block satisfying the following Case1 or Case2, the swap pixel Mij and Mmn .
Case1 Case2
Ha Hb S
A + BBA