Abstract
In a multi-secret image sharing scheme, participants are able to share multiple secret images such the way that each secret image can be reconstructed according to the corresponding access structure. In this paper, employing Chan and Chang’s multi-secret sharing, we propose a new multi-threshold secret image sharing scheme. In the secret image sharing process, based on the generalized CRT, secret values are produced according to the associated access structures. The shadow images can be generated by embedding the secret values into a cover image using the quantization operation. The new scheme allows a qualified subset of participants to retrieve the related secret image. Moreover, any monotone access structure can be realized with a deletion procedure. The experiments demonstrate that secret images can be recovered without distortion. Besides, the quality of the shadow images is satisfactory and the capacity of embedded secret values is acceptable especially under binary images.
Similar content being viewed by others
References
Barwick SG, Jackson WA (2005) An optimal multisecret threshold scheme construction. Des Codes Crypt 37(3):367–389
J. Benaloh, J. Leichter (1989) Generalized secret sharing and monotone functions, in: S. Goldwasser (Ed.), Advances in Cryptology, CRYPTO’88, in: Lecture Notes in Computer Science, vol. 403, 1989, pp. 27–35
Blakley GR (1979) Safeguarding cryptographic keys. Proc AFIPS Nat Compu Conf 48:313–317
Chan CW, Chang CC (2005) A scheme for threshold multi-secret sharing. Appl Math Comput 166(1):1–14
Feng JB, Wu HC, Tsai CS, Chu YP (2005) A new multi-secret images sharing scheme using Largrange’s interpolation. J Syst Softw 76(3):327–339
Guo C, Chang CC, Qin C (2012) A multi-threshold secret image sharing scheme based on MSP. Pattern Recogn Lett 33(12):1594–1600
Ito M, Saito A, Nishizeki T (1989) Secret sharing scheme realizing general access structure. Electron Commun Jpn (Part III: Fundamental Electronic Science) 72(9):56–64
Kumar S, Sharma RK (2014) Threshold visual secret sharing based on boolean operations. Sec Commun Net 7(3):653–664
Lin PY, Lee JS, Chang CC (2009) Distortion-free secret image sharing mechanism using modulus operator. Pattern Recogn 42(5):886–895
Lin C, Tsai W (2004) Secret image sharing with steganography and authentication. J Syst Softw 73(3):405–414
Naor M, Shamir A (1995) Visual cryptography. Lect Notes Comput Sci 950:1–12
Pakniat N, Noroozi M, Eslami Z (2014) Secret image sharing scheme with hierarchical threshold access structure. J Visual Commun Image Represent 25(5):1093–1101
Sasaki M, Watanabe Y (2014) Formulation of visual secret sharing schemes encrypting multiple images. In Acoustics, Speech and Signal Processing (ICASSP), 2014 I.E. International Conference on (pp. 7391–7395)
Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613
Stinson DR (1994) Decomposition constructions for secret sharing schemes. IEEE Trans Inf Theory 40:118–125
Ulutas M, Ulutas G, Nabiyev VV (2013) Invertible secret image sharing for gray level and dithered cover images. J Syst Softw 86(2):485–500
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
Yan X, Wang S, Niu X et al (2015) Random grid-based visual secret sharing with multiple decryptions. J Vis Commun Image Represent 26:94–104
Yang CN, Chen TS, Yu KH, Wang CC (2007) Improvements of image sharing with steganography and authentication. J Syst Softw 80–7:1070–1076
Acknowledgments
This paper is supported by the National Science Foundation of China under grant No. 61272173, 61100194, 61401060 and the general program of Liaoning Provincial Department of Education Science Research under grants L2014017.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guo, C., Zhang, H., Song, Q. et al. A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem. Multimed Tools Appl 75, 11577–11594 (2016). https://doi.org/10.1007/s11042-015-2885-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-015-2885-x