Differently from traditional secret sharing, progressive secret sharing can gain clearer recovered secret image with more shares. However, previous progressive visual secret sharing (PVSS) schemes with unexpanded shares are only for case (2, n) other than general threshold (case), which will restrict the application range. In this paper, a general threshold PVSS construction method from case (2, n) with unexpanded shares is proposed. It has the feature of (k, n) threshold with no pixel expansion, which could be loss-tolerant and control access for a wider application. Based on the proposed construction method, a new threshold PVSS scheme is constructed. Compared with relative approaches, the proposed scheme has improved performances.
This is a preview of subscription content, log in to check access.
The authors would like to thank the anonymous reviewers for their valuable discussions and comments. This work is supported by the National Natural Science Foundation of China (Grant Number: 61100187, 61301099, 61361166006).
Chen S-K (2009) Friendly progressive visual secret sharing using generalized random grids. Optical Eng 48(11):117001-1–117001-7CrossRefGoogle Scholar
Chen T-H, Tsao K-H (2011) Threshold visual secret sharing by random grids. J Syst Software 84:1197–1208CrossRefGoogle Scholar
Chen T-H et al (2013) Quality-adaptive visual secret sharing by random grids. J Syst Softw 86(5):1267–1274CrossRefGoogle Scholar
Fang W-P, Lin J-C (2006) Progressive viewing and sharing of sensitive images. Pattern Recog Image Analysis 16(4):632–636CrossRefGoogle Scholar
Guo T, Liu F, Wu CK (2013) Threshold visual secret sharing by random grids with improved contrast. J Syst Software 86(8):2094–2109CrossRefGoogle Scholar