In previous (k,n) secret image sharing scheme, the threshold k is decided by dealer according to the security requirement, and this threshold value is fixed without considering the dynamic secure environment in future. In this work, we propose a novel threshold changeable secret image sharing scheme where the threshold value can be changed according to the changeable security requirement. In our scheme, each participant only needs to keep one initial shadow. When reconstructing image, the dealer decides the threshold according to security level. If the threshold is unchanged, any k or more initial shadows can recover the image; else if the threshold is increased or decreased, dealer publishes additional information, each participant update their shadows accordingly such that the threshold of updated shadows is changed correspondingly. The contribution of our work is that the threshold of shadows can be changed flexibly to satisfy the dynamic secure environment, and each participant only need to keep one initial shadows. The feature of threshold changeable makes our scheme more practical than previous secret image sharing in some complicated applications.
This is a preview of subscription content, log in to check access.
The research presented in this paper is supported in part by the China National Natural Science Foundation (No.: 61502384, 61571360, 61872289), Shaanxi Science and Technology Co-ordination and Innovation Project (No.: 2016KTZDGY05-09), and the Innovation Project of Shaanxi Provincial Department of Education (No.: 17JF023). This research was supported in part by Ministry of Science and Technology (MOST), under Grant 107-2221-E-259-007.
Blundo C, Cresti A, Santis A, Vaccaro U (1994) Fully dynamic secret sharing schemes. In: Advances in cryptology CRYPTO’92: proceedings of the 13th annual international cryptology conference, London, pp 110–125Google Scholar
Chao H, Fan TY (2017) Random-grid based progressive visual secret sharing scheme with adaptive priority. Digital Signal Process 68:69–80CrossRefGoogle Scholar
Chao K, Lin JC (2009) Secret image sharing: a Boolean-operations-based approach combining benefits of polynomial-based and fast Approaches. Int J Pattern Recognit Artif Intell 23:263–285CrossRefGoogle Scholar
Gong X, Hu P, Shum K, Sung CW (2018) A Zigzag-Decodable ramp secret sharing scheme. IEEE Trans Inf Forensics Secur 13(8):1906–1916CrossRefGoogle Scholar
Harn L, Hsu CF (2015) Dynamic threshold secret reconstruction and its application to the threshold cryptography. Inf Process Lett 115(11):851–857MathSciNetCrossRefGoogle Scholar
Li P, Yang C, Wu, Kong Q, Ma Y (2013) Essential secret image sharing scheme with different importance of shadows. J Vis Commun Image Represent 24(7):1106–1114CrossRefGoogle Scholar
Liu Y, Nie L, Han L, Zhang L, Rosenblum DS (2015) Action2activity: recognizing complex activities from sensor data. In: Proceedings of the twenty-fourth international joint conference of artificial intelligence (IJCAI), pp 1617–1623Google Scholar
Liu Y, Nie L, Liu L, Rosenblum DS (2016) From action to activity: Sensor-based activity recognition. Neurocomputing 181:108–115CrossRefGoogle Scholar
Liu Y, Yang C, Wu S, Chou YS (2018) Progressive (k,n) secret image sharing schemes based on Boolean operations and covering codes. Signal Process Image Commun 66:77–86CrossRefGoogle Scholar
Liu Y, Yang C, Yeh PH (2014) Reducing shadow size in smooth scalable secret image sharing. Security and Communication Networks 7(12):2237–2244CrossRefGoogle Scholar
Liu Y, Yang CN (2017) Scalable secret image sharing scheme with essential shadows. Signal Process Image Commun 58:49–55CrossRefGoogle Scholar