Traditional (k, n) secret image sharing provides all-or-nothing decoding model and (k, n) scalable secret image sharing provides progress decoding model during image reconstruction. Both these two decoding models are significance in various applications. However, the security level for real applications would change due to the dynamical environment, only one single decoding model cannot satisfy the changeable security requirement. In this work, we construct scalable secret image sharing schemes that provides both all-or-nothing and progress decoding models to satisfy the dynamical secure requirement. Each participant in our schemes only needs to keep one initial-shadow. During image reconstruction, the dealer selects the decoding model according to current security requirement, if progress model is chosen, initial shadows can achieve image reconstruction in progress model without any modification; else if all-or-nothing model is chosen, the dealer does not need to resent new shadows to participants, the initial-shadows can be updated to satisfy all-or-nothing model efficiently.
C.C.Thien and J.C.Lin, Secret image sharing, Computers and Graphics26(5) (2002), 765–770.
2.
M.Naor and A.Shamir, Visual cryptography, Proc of EUROCRYPT1994, LNCS 950, 1995, pp. 1–12.
3.
R.Z.Wang and C.H.Su, Secret image sharing with smaller shadow images, Pattern Recognition Letters27 (2006), 551–555.
4.
C.C.Wu, S.J.Kao and M.S.Hwang, A high quality image sharing with steganography and adaptive authentication scheme, Journal of Systems and Software84 (2011), 2196–2207.
5.
LiuY.X.,
YangC.N.,
WuC.M.,
SunQ.D. and BiW., Threshold changeable secret image sharing scheme based on interpolation polynomial, Multimedia Tools and Applications78 (2019), 18653–18667.
6.
S.J.Shyu and H.W.Jiang, General constructions for threshold multiple-secret visual cryptography Schemes, IEEE Transactions on Information Forensics and Security8 (2013), 733–743.
7.
C.N.Yang and Y.Y.Yang, New extended visual cryptography schemes with clearer shadow images, Information Sciences271 (2014), 246–263.
8.
S.Lal and Prof.S.Sharma, Load balancing and its challenges in cloud computing: A review paper, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE)5(12) (2017).
9.
T.H.N.Le, C.C.Lin, C.C.Chang and H.B.Le, A high quality and small shadow size visual secret sharing scheme based on hybrid strategy for grayscale images, Digital Signal Processing21 (2011), 734–745.
10.
J.S.Lee, C.C.Chang, N.T.Huynh and H.Y.Tsai, Preserving user-friendly shadow and high-contrast quality for multiple visual secret sharing technique, Digital Signal Processing40 (2015), 131–139.
11.
R.Z.Wang and S.J.Shyu, Scalable secret image sharing, Signal Processing: Image Communication22(4) (2007), 363–373.
12.
C.N.Yang and S.M.Huang, Constructions and properties of k out of n scalable secret image sharing, Optics Communications283(9) (2010), 1750–1762.
13.
C.N.Yang and Y.Y.Chu, A general (k,n) scalable secret image sharing scheme with the smooth scalability, Journal of Systems and Software84(10) (2011), 1726–1733.
14.
Y.Y.Lin and R.Z.Wang, Scalable secret image shaing with smaller shadow images, IEEE Signal Processing Letters17(3) (2010), 316–319.
15.
Y.X.Liu, C.N.Yang and P.H.Yeh, Reducing shadow size in smooth scalable secret image sharing, Security and Communication Networks7(12) (2014), 2237–2244.
16.
P.Li, Z.Liu and C.N.A.Yang, Construction Method of (t,k,n)-essential secret image sharing scheme, Signal Processing: Image Communication65 (2018), 210–220.
17.
P.Lakhanpal and Prof.D.Agrawal, Enhanced secure mechanism for ARP poisoning and MITM attack, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE)6(1) (2018).
18.
P.Li, C.N.Yang and Z.Zhou, Essential secret image sharing scheme with the same size of shadows, Digital Signal Processing50 (2016), 51–60.
19.
C.N.Yang, P.Li, C.C.Wu and S.R.Cai, Reducing shadow size in sssential secret image sharing by conjunctive herarchical approach, Signal Processing: Image Communication31 (2015), 1–9.
20.
Y.X.Liu and C.N.Yang, Scalable secret image sharing scheme with essential shadows, Signal Processing: Image Communication58 (2017), 49–55.
21.
C.N.Yang, H.W.Shih, C.C.Wu and L.Harn, K out of n region incrementing scheme in visual cryptography, IEEE Transactions on Circuits and Systems for Video Technology22(5) (2012), 799–809.
22.
S.Maheswari and K.Chitra, A novel approach for software defect prediction using learning algorithms, International Journal of Innovative Research in Computer and Communication Engineering (IJIRCCE)5(11) (2017).
23.
C.N.Yang, Y.C.Lin and C.C.Wu, Region in region incrementing visual cryptography scheme, Proc IWDW2012, LNCS 7809 (2013), 449–463.
24.
Y.X.Liu, C.N.Yang, S.Y.Wu and Y.S.Chou, Progressive (k,n) secret image sharing schemes based on Boolean operations and covering codes, Signal Processing: Image Communication66 (2018), 77–86.
25.
L.T.Liu, Y.L.Lu, X.H.Yan and H.X.Wan, Greyscale-images-oriented progressive secret sharing based on the linear congruence equation, Multimedia Tools and Applications2 (2017), 1–28.
L.Harn and C.F.Hsu, Dynamic threshold secret reconstruction and its application to the threshold cryptography, Information Processing Letters115(11) (2015), 851–857.
28.
L.Yuan, M.Li, C.Guo, K.-K.R.Choo and Y.Ren, Novel threshold changeable secret sharing schemes based on polynomial interpolation, PloS One11(10) (2016), 1–19.
29.
X.Yan, Y.Lu, L.Liu, J.Liu and G.Yang, Chinese remainder theorem-based two-in-one image secret sharing with three decoding options, Digital Signal Processing82 (2018), 80–90.
