Abstract
A secret image is split into \(\) shares in the generation phase of secret image sharing (SIS) for a \(\) threshold. In the recovery phase, the secret image is recovered when any \(\) or more shares are collected, and each collected share is generally assumed to be lossless in conventional SIS during storage and transmission. However, noise will arise during real-world storage and transmission; thus, shares will experience data loss, which will also lead to data loss in the secret image being recovered. Secret image recovery in the case of lossy shares is an important issue that must be addressed in practice, which is the overall subject of this article. An SIS scheme that can recover the secret image from lossy shares is proposed in this article. First, robust SIS and its definition are introduced. Next, a robust SIS scheme for a \(\) threshold without pixel expansion is proposed based on the Chinese remainder theorem (CRT) and error-correcting codes (ECC). By screening the random numbers, the share generation phase of the proposed robust SIS is designed to implement the error correction capability without increasing the share size. Particularly in the case of collecting noisy shares, our recovery method is to some degree robust to some noise types, such as least significant bit (LSB) noise, JPEG compression, and salt-and-pepper noise. A theoretical proof is presented, and experimental results are examined to evaluate the effectiveness of our proposed method.
- C. Asmuth and J. Bloom. 1983. A modular approach to key safeguarding. IEEE Trans. Inf. Theor. 29, 2 (1983), 208–210.Google Scholar
Digital Library
- L. Bao, S. Yi, and Y. Zhou. 2017. Combination of sharing matrix and image encryption for lossless \(\)—Secret image sharing. IEEE Trans. Image Proc. 26, 12 (Dec. 2017), 5618–5631. DOI:https://doi.org/10.1109/TIP.2017.2738561Google Scholar
Digital Library
- Akram Belazi and Ahmed A. Abd El-Latif. 2017. A simple yet efficient S-box method based on chaotic sine map. Optik - Int. J. Light Electron Optics 130 (2017), 1438–1444. Google Scholar
Cross Ref
- Z. Chen, X. Hou, X. Qian, and C. Gong. 2018. Efficient and robust image coding and transmission based on scrambled block compressive sensing. IEEE Trans. Multimedia 20, 7 (July 2018), 1610–1621. DOI:https://doi.org/10.1109/TMM.2017.2774004Google Scholar
- Yuqiao Cheng, Zhengxin Fu, and Bin Yu. 2018. Improved visual secret sharing scheme for QR code applications. IEEE Trans. Inf. Forens. Secur. 13, 9 (2018), 2393–2403.Google Scholar
Digital Library
- Ting Wei Chuang, Chaur Chin Chen, and Betty Chien. 2016. Image sharing and recovering based on Chinese remainder theorem. In International Symposium on Computer, Consumer and Control. 817–820.Google Scholar
Cross Ref
- Hu Chunqiang, Liao Xiaofeng, and Xiao Di. 2012. Secret image sharing based on chaotic map and Chinese remainder theorem. Int. J. Wavel. Multires. Inf. Proc. 10, 3 (2012), 1250023 (2012).Google Scholar
- Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, and Gabriele Spini. 2015. Linear secret sharing schemes from error correcting codes and universal hash functions. In Advances in Cryptology - EUROCRYPT 2015, Elisabeth Oswald and Marc Fischlin (Eds.). Springer Berlin, 313–336. Google Scholar
- Mohammad Ghebleh and Ali Kanso. 2018. A novel secret image sharing scheme using large primes. Multimedia Tools Applic. 77, 10 (01 May 2018), 11903–11923. DOI:https://doi.org/10.1007/s11042-017-4841-4Google Scholar
- Xingxing Jia, Daoshun Wang, Qimeng Chu, and Zhenhua Chen. 2019. An efficient XOR-based verifiable visual cryptographic scheme. Multimedia Tools Applic. 78, 7 (01 Apr. 2019), 8207–8223. DOI:https://doi.org/10.1007/s11042-018-6779-6Google Scholar
- Ilan Komargodski and Anat Paskin-Cherniavsky. 2017. Evolving secret sharing: Dynamic thresholds and robustness. In Theory of Cryptography, Yael Kalai and Leonid Reyzin (Eds.). Springer International Publishing, Cham, 379–393. Google Scholar
- L. Li, Y. Lu, X. Yan, L. Liu, and L. Tan. 2019. Lossless \(\)—Threshold image secret sharing based on the Chinese remainder theorem without auxiliary encryption. IEEE Access 7 (2019), 75113–75121. DOI:https://doi.org/10.1109/ACCESS.2019.2921612Google Scholar
Cross Ref
- Y. Li, Z. Lu, C. Zhu, and X. Niu. 2012. Robust image hashing based on random Gabor filtering and dithered lattice vector quantization. IEEE Trans. Image Proc. 21, 4 (Apr. 2012), 1963–1980. DOI:https://doi.org/10.1109/TIP.2011.2171698Google Scholar
- Feng Liu and Chuankun Wu. 2011. Embedded extended visual cryptography schemes. IEEE Trans. Inf. Forens. Secur. 6, 2 (2011), 307–322.Google Scholar
Digital Library
- Xiaobei Liu, Soo Ngee Koh, Xin Wen Wu, and Chee Cheon Chui. 2012. Reconstructing a linear scrambler with improved detection capability and in the presence of noise. IEEE Trans. Inf. Forens. Secur. 7, 1 (2012), 208–218.Google Scholar
Digital Library
- Yanxiao Liu, Chingnung Yang, Yichuan Wang, Lei Zhu, and Wenjiang Ji. 2018. Cheating identifiable secret sharing scheme using symmetric bivariate polynomial. Inf. Sci. 453 (2018), 21–29. Google Scholar
Cross Ref
- Moni Naor and Adi Shamir. 1995. Visual cryptography. In Advances in Cryptology-EUROCRYPT’94 Lecture Notes in Computer Science, Workshop on the Theory and Application of Cryptographic Techniques. Springer, 1–12.Google Scholar
- Z. Qian, X. Zhang, and S. Wang. 2014. Reversible data hiding in encrypted JPEG bitstream. IEEE Trans. Multimedia 16, 5 (Aug. 2014), 1486–1491. DOI:https://doi.org/10.1109/TMM.2014.2316154Google Scholar
Cross Ref
- V. Rishiwal, M. Yadav, and K. V. Arya. 2008. A robust secret image sharing scheme. In 1st International Conference on Emerging Trends in Engineering and Technology. 11–14. DOI:https://doi.org/10.1109/ICETET.2008.109Google Scholar
- Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612–613.Google Scholar
Digital Library
- K. Shankar and P. Eswaran. 2016. A new k out of n secret image sharing scheme in visual cryptography. In 10th International Conference on Intelligent Systems and Control (ISCO’16). 1–6. DOI:https://doi.org/10.1109/ISCO.2016.7726969Google Scholar
- Shyong Jian Shyu and Ying Ru Chen. 2008. Threshold secret image sharing by Chinese remainder theorem. In IEEE Asia-Pacific Services Computing Conference. 1332–1337.Google Scholar
Digital Library
- Chih-Ching Thien and Ja-Chen Lin. 2002. Secret image sharing. Comput. Graph. 26, 5 (2002), 765–770.Google Scholar
Cross Ref
- M. Ulutas, V. V. Nabiyev, and G. Ulutas. 2009. A new secret image sharing technique based on Asmuth Bloom’s scheme. In International Conference on Application of Information and Communication Technologies (AICT’09). 1–5.Google Scholar
- Guangyu Wang, Feng Liu, and Wei Qi Yan. 2016. Basic visual cryptography using braille. Int. J. Digit. Crime Forens. 8, 3 (2016), 85–93.Google Scholar
Digital Library
- Ping Wang, Xing He, Yushu Zhang, Wenying Wen, and Ming Li. 2019. A robust and secure image sharing scheme with personal identity information embedded. Comput. Secur. 85 (2019), 107–121. DOI:https://doi.org/10.1016/j.cose.2019.04.010Google Scholar
Digital Library
- Zhongmin Wang, Gonzalo R. Arce, and Giovanni Di Crescenzo. 2009. Halftone visual cryptography via error diffusion. IEEE Trans. Inf. Forens. Secur. 4, 3 (2009), 383–396.Google Scholar
Digital Library
- Zhou Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli. 2004. Image quality assessment: From error visibility to structural similarity. IEEE Trans. Image Proc. 13, 4 (Apr. 2004), 600–612. DOI:https://doi.org/10.1109/TIP.2003.819861Google Scholar
Digital Library
- Jonathan Weir, Weiqi Yan, and Mohan S. Kankanhalli. 2012. Image hatching for visual cryptography. ACM Trans. Multimedia Comput. Commun. Appl. 8, 2S (Sept. 2012). DOI:https://doi.org/10.1145/2344436.2344438Google Scholar
Digital Library
- Weiqi Yan, Wei Ding, and Qi Dongxu. 2000. Image sharing based on Chinese remainder theorem. J. North China Univ. of Tech 12, 1 (2000), 6–9.Google Scholar
- Xuehu Yan, Yuliang Lu, Lintao Liu, Jingju Liu, and Guozheng Yang. 2018. Chinese remainder theorem-based two-in-one image secret sharing with three decoding options. Digit. Sig. Proc. 82 (2018), 80–90. DOI:https://doi.org/10.1016/j.dsp.2018.07.015Google Scholar
Cross Ref
- Xuehu Yan, Yuliang Lu, Lintao Liu, and Xianhua Song. 2020. Reversible image secret sharing. IEEE Trans. Inf. Forens. Secur. 15 (2020), 3848–3858. DOI:https://doi.org/doi: 10.1109/TIFS.2020.3001735Google Scholar
Digital Library
- Xuehu Yan, Yuliang Lu, Lintao Liu, Song Wan, Wanmeng Ding, and Hanlin Liu. 2017. Chinese remainder theorem-based secret image sharing for (k, n) threshold. Third International Conference of Cloud Computing and Security (ICCCS’17)433–440. DOI:https://doi.org/10.1007/978-3-319-68542-7_36Google Scholar
Cross Ref
- C. Yang, C. Wu, and Y. Lin. 2019. \(\) out of \(\) region-based progressive visual cryptography. IEEE Trans. Circ. Syst. Vid. Technol. 29, 1 (Jan. 2019), 252–262. DOI:https://doi.org/10.1109/TCSVT.2017.2771255Google Scholar
- Ching-Nung Yang and Chuei-Bang Ciou. 2010. Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability. Image Vis. Comput. 28, 12 (2010), 1600–1610.Google Scholar
Digital Library
- X. Zhang, F. Peng, and M. Long. 2018. Robust coverless image steganography based on DCT and LDA topic classification. IEEE Trans. Multimedia 20, 12 (Dec. 2018), 3223–3238. DOI:https://doi.org/10.1109/TMM.2018.2838334Google Scholar
Digital Library
- Zhi Zhou, Gonzalo R. Arce, and Giovanni Di Crescenzo. 2006. Halftone visual cryptography. IEEE Trans. Image Proc. 15, 8 (2006), 2441–2453.Google Scholar
Digital Library
- Zhili Zhou, Yan Mu, and Q. M. Jonathan Wu. 2019. Coverless image steganography using partial-duplicate image retrieval. Soft Comput. 23 (2019), 4927–4938.Google Scholar
Digital Library
- Zhili Zhou, Q. M. Jonathan Wu, Yimin Yang, and Xingming Sun. 2020. Region-level visual consistency verification for large-scale partial-duplicate image search. ACM Trans. Multimedia Comput., Commun., Applic. 16, 2 (2020).Google Scholar
- Z. Zhou, C. Yang, Y. Cao, and X. Sun. 2018. Secret image sharing based on encrypted pixels. IEEE Access 6 (2018), 15021–15025. DOI:https://doi.org/10.1109/ACCESS.2018.2811722Google Scholar
Cross Ref
Index Terms
Robust Secret Image Sharing Resistant to Noise in Shares
Recommendations
An efficient verifiable (t,n)-threshold secret image sharing scheme with ultralight shares
AbstractA secret sharing scheme partitions a secret into a set of shares and distributes them among the eligible participants, with each participant receiving one share of the secret. The sharing technique allows any qualified subset of participants to ...
A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem
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-...
Image Secret Sharing Construction for General Access Structure with Meaningful Share
This article describes how the (k, n) threshold image secret sharing technology can recover the secret image even n − k shares are lost, or n−k servers do not work, which is useful for cloud storage, etc. Image secret sharing for general access ...






Comments