Abstract
Scalable secret image sharing (SSIS) is a new secret image sharing technique. The feature of scalability refers to the fact that the revealed secret information is proportional to the number of gathered shadows. Once all of the valid shadows are collected, the complete secret can be revealed easily. The kernel of secret information, however, may be leaked out with a few shadows collected in the existing SSIS mechanisms. This is because researchers seldom concerned about secret distribution. Thus, we introduce the Salient map to develop a new method, in which the ROIs (region of interesting) of secret image can be revealed progressively. Additionally, we introduce the concepts of meaningful shadow and verification to SSIS. To the best of our knowledge, this is the first SSIS that employs a meaningful shadow. The leading adoption can greatly help reduce the attention of attackers in order to enhance the security, while the second concept can avoid malicious behaviors from outside attackers or dishonest members.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang CC, Hsieh YP, Lin CH (2008) Sharing secrets in stego images with authentication. Pattern Recogn 41(10):3130–3137
Hou YC, Wei SC, Lin CY (2014) Random-grid-based visual cryptography schemes. IEEE Trans Circuits Syst Video Technol 24:733–744
Jiang H, Wang J, Yuan Z, Wu Y, Zheng N, Li S (2013) Salient object detection: A discriminative regional feature integration approach. 2013 I.E. Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2083–2090
Lin PY, Chan CS (2010) Invertible secret image sharing with steganography. Pattern Recogn Lett 31(13):1887–1893
Lin PY, Chang CC (2011) Cheating resistance and reversibility oriented secret sharing mechanism. IET Inf Secur 5(2):81–92
Lin KS, Lin CH, Chen TH (2014) Distortionless visual multi-secret sharing based on random grid. Inf Sci 288:330–346
Lin CC, Tsai WH (2004) Secret image sharing with steganography and authentication. J Syst Softw 73(3):405–414
Rao TRN, Yang CH (2006) Aryabhata remainder theorem: relevance to public-key crypto-algorithms. Circuits Syst Signal Process 25(1):1–15
Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613
Thien CC, Lin JC (2002) Secret image sharing. Comp Graph 26:765–770
Wang RZ, Chien YF, Lin YY (2010) Scalable user-friendly image sharing. J Vis Commun Image Represent 21(7):751–761
Wang RZ, Shyu SJ (2007) Scalable secret image sharing. Signal Process Image Commun 22(4):363–373
Wang RZ, Su CH (2006) Secret image sharing with smaller shadows. Pattern Recogn Lett 27:551–555
Wu X, Sun W (2013) Random grid-based visual secret sharing with abilities of OR and XOR decryptions. J Vis Commun Image Represent 24:48–62
Yang CN, Chen TS, Yu KH, Wang CC (2007) Improvements of image sharing with steganography and authentication. J Syst Softw 80(7):1070–1076
Yang CN, Chu YY (2011) A general (k, n) scalable secret image sharing scheme with the smooth scalability. J Syst Softw 84(10):1726–1733
Yang CN, Huang SM (2010) Constructions and properties of k out of n scalable secret image sharing. Opt Commun 283:1750–1762
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lee, JS., Chen, YR. Selective scalable secret image sharing with verification. Multimed Tools Appl 76, 1–11 (2017). https://doi.org/10.1007/s11042-015-3011-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-015-3011-9