Abstract
Conventional (k, n)-threshold visual secret sharing of random grids (VSSRG) schemes generate n shares having the same average light transmission from a secret image to be shared, and any information related to the secret image cannot be identified externally from a single share held by one participant. In addition, the secret image can be recovered only by collecting k shares individually held by participants, and every share has the same capability of recovering the secret image. In fact, participants’ priority levels vary in certain conditions, and therefore their shares’ capabilities to recover the secret image are different. The priority-based (k, n)-threshold VSSRG scheme proposed in this study enables the assignment of different priority weights to each share to create different priority levels. During decryption, the stacking of shares with different priority levels recovers the secret image at different levels. Moreover, shares individually held by each participant have the same average light transmission, and consequently the shares’ priority levels cannot be identified externally.
Similar content being viewed by others
References
Chen TH, Tsao KH (2009) Visual secret sharing by random grids revisited. Pattern Recogn 42(9):2203–2217
Chen TH, Tsao KH (2011) Threshold visual secret sharing by random grids. J Syst Softw 84(7):1197–1208
Fang WP, Lin JC (2006) Progressive viewing and sharing of sensitive images. Pattern Recogn Image Anal 16(4):632–636
Hou YC, Quan ZY, Tsai CF (2015) A privilege-based visual secret sharing model. J Vis Commun Image R 33:358–367
Kafri O, Keren E (1987) Encryption of pictures and shapes by random grids. Opt Lett 12:377–379
Kumar S, Sharma RK (2014) Threshold visual secret sharing based on Boolean operations. Secur Comm Netw 7:653–664
Lee YS, Wang BJ, Chen TH (2013) Quality-improved threshold visual secret sharing scheme by random grids. IET Image Process 7(2):137–143
Naor M, Shamir A (1995) Visual cryptography. Advances in cryptology-EuroCrypt’94 950: 1–12
Shyu SJ (2007) Image encryption by random grids. Pattern Recogn 40(3):1014–1031
Shyu SJ (2009) Image encryption by multiple random grids. Pattern Recogn 42(7):1582–1596
Shyu SJ, Chen MC (2011) Optimum pixel expansions for threshold visual secret sharing schemes. IEEE Trans Inf Forensics Secur 6(3):960–969
Shyu SJ, Huanga SY, Lee YK, Wang RZ, Chen K (2007) Sharing multiple secrets in visual cryptography. Pattern Recogn 40(12):3633–3651
Wu X, Sun W (2012) Visual secret sharing for general access structures by random grids. IET Inf Secur 6(4):299–309
Wu X, Sun W (2013) Improving the visual quality of random grid-based visual secret sharing. Signal Proc 93(5):977–995
Yan X, Liu X, Yang CN (2015) An enhanced threshold visual secret sharing based on random grids. J real-time image proc 1–13
Yu B, Shen G (2014) Multi-secret visual cryptography with deterministic contrast. Multimed Tools App 72(2):1867–1886
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chao, HC., Fan, TY. Priority visual secret sharing of random grids for threshold access structures. Multimed Tools Appl 77, 11867–11882 (2018). https://doi.org/10.1007/s11042-017-4836-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-017-4836-1