Abstract
We propose a novel (t,n)–threshold secret image sharing scheme based on Shamir’s polynomial interpolation paradigm. The proposed scheme is a derivative of Thien and Lin’s (Computers & Graphics 26(5):765–770, [13]) and some of its variants by ensuring less intrusive changes in the secret image. This is achieved by cyclically shifting the bits of the secret image, thus allowing a modification in the least significant bit to have a large effect on the values used in computation of shadow images. Statistical tests and simulations are presented to show the efficiency and robustness of the proposed scheme, in particular good randomness of shadow images, little correlation between adjacent pixels, and high entropy. Competence of the proposed scheme is further demonstrated by means of comparison with existing schemes.
Similar content being viewed by others
References
Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp 313–317
Chang CC, Hsieh YP, Lin CH (2008) Sharing secrets in stego images with authentication. Pattern Recogn 41(10):3130–3137
Chang CC, Lin CC, Lin CH, Chen YH (2008) A novel secret image sharing scheme in color images using small shadow images. Inf Sci 178(11):2433–2447
Chen YR, Chen LH, Shyu SJ (2015) Secret image sharing with smaller shadow sizes for general access structures. Multimedia Tools and Applications 1–17
Ghebleh M, Kanso A (2014) A robust chaotic algorithm for digital image steganography. Commun Nonlinear Sci Numer Simul 19(6):1898–1907
Guo C, Chang CC, Qin C (2014) A novel (n,t,n) secret image sharing scheme without a trusted third party. Multimedia Tools Appl 72 (3):2195–2209
Kanso A (2011) Self-shrinking chaotic stream ciphers. Commun Nonlinear Sci Numer Simul 16(2):822–836
Lin CC, Tsai WH (2004) Secret image sharing with steganography and authentication. J Syst Softw 73(3):405–414
Liu L, Wang A, CHang C, Li Z, Liu J (2015) A lossy secret color image sharing scheme with small shadows and error-resilient capability. J Inf Hiding Multimedia Signal Process 6(2):246–253
Ott E (2002) Chaos in dynamical systems. Cambridge university press
Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613
Shannon CE (1951) Prediction and entropy of printed english. Bell Syst Tech J 30(1):50–64
Thien CC, Lin JC (2002) Secret image sharing. Comput Graph 26(5):765–770
Thien CC, Lin JC (2003) An image-sharing method with user-friendly shadow images. IEEE Trans Circuits Syst Video Technol 13(12):1161–1169
Tsai CS, Chang CC, Chen TS (2002) Sharing multiple secrets in digital images. J Syst Softw 64(2):163–170
Tsai DS, Horng G, Chen TH, Huang YT (2009) A novel secret image sharing scheme for true-color images with size constraint. Inf Sci 179(19):3247–3254
Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13 (4):600–612
Wu KS (2013) A secret image sharing scheme for light images. EURASIP J Adv Signal Process 2013(1):1–5
Yang CN, Chen TS, Yu KH, Wang CC (2007) Improvements of image sharing with steganography and authentication. J Syst Softw 80(7):1070–1076
Zhao R, Zhao JJ, Dai F, Zhao FQ (2009) A new image secret sharing scheme to identify cheaters. Comput Stand Interfaces 31(1):252–257
Acknowledgments
We would like to thank the anonymous referees for their consideration of this manuscript and their helpful remarks.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kanso, A., Ghebleh, M. An efficient (t,n)–threshold secret image sharing scheme. Multimed Tools Appl 76, 16369–16388 (2017). https://doi.org/10.1007/s11042-016-3917-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-016-3917-x