research-article

Open access

Robust Secret Image Sharing Resistant to Noise in Shares

Authors:

Yuliang LuAuthors Info & Claims

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM), Volume 17, Issue 1

Article No.: 24, Pages 1 - 22

https://doi.org/10.1145/3419750

Published: 16 April 2021 Publication History

All formats PDF

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.

References

[1]

C. Asmuth and J. Bloom. 1983. A modular approach to key safeguarding. IEEE Trans. Inf. Theor. 29, 2 (1983), 208–210.

Digital Library

[2]

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.

Digital Library

[3]

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.

[4]

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.

[5]

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.

Digital Library

[6]

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.

[7]

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).

[8]

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.

[9]

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.

[10]

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.

[11]

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.

[12]

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.

[13]

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.

[14]

Feng Liu and Chuankun Wu. 2011. Embedded extended visual cryptography schemes. IEEE Trans. Inf. Forens. Secur. 6, 2 (2011), 307–322.

Digital Library

[15]

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.

Digital Library

[16]

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.

[17]

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.

[18]

Z. Qian, X. Zhang, and S. Wang. 2014. Reversible data hiding in encrypted JPEG bitstream. IEEE Trans. Multimedia 16, 5 (Aug. 2014), 1486–1491.

[19]

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.

[20]

Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612–613.

Digital Library

[21]

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.

[22]

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.

Digital Library

[23]

Chih-Ching Thien and Ja-Chen Lin. 2002. Secret image sharing. Comput. Graph. 26, 5 (2002), 765–770.

[24]

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.

[25]

Guangyu Wang, Feng Liu, and Wei Qi Yan. 2016. Basic visual cryptography using braille. Int. J. Digit. Crime Forens. 8, 3 (2016), 85–93.

Digital Library

[26]

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.

Digital Library

[27]

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.

Digital Library

[28]

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.

Digital Library

[29]

Jonathan Weir, Weiqi Yan, and Mohan S. Kankanhalli. 2012. Image hatching for visual cryptography. ACM Trans. Multimedia Comput. Commun. Appl. 8, 2S (Sept. 2012).

Digital Library

[30]

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.

[31]

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.

[32]

Xuehu Yan, Yuliang Lu, Lintao Liu, and Xianhua Song. 2020. Reversible image secret sharing. IEEE Trans. Inf. Forens. Secur. 15 (2020), 3848–3858. 10.1109/TIFS.2020.3001735

Digital Library

[33]

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.

[34]

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.

[35]

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.

Digital Library

[36]

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.

Digital Library

[37]

Zhi Zhou, Gonzalo R. Arce, and Giovanni Di Crescenzo. 2006. Halftone visual cryptography. IEEE Trans. Image Proc. 15, 8 (2006), 2441–2453.

Digital Library

[38]

Zhili Zhou, Yan Mu, and Q. M. Jonathan Wu. 2019. Coverless image steganography using partial-duplicate image retrieval. Soft Comput. 23 (2019), 4927–4938.

Digital Library

[39]

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).

[40]

Z. Zhou, C. Yang, Y. Cao, and X. Sun. 2018. Secret image sharing based on encrypted pixels. IEEE Access 6 (2018), 15021–15025.

Cited By

Li DWang LJin X(2024)Cartoon copyright recognition method based on character personality actionJournal on Image and Video Processing10.1186/s13640-024-00627-22024:1Online publication date: 24-May-2024
https://dl.acm.org/doi/10.1186/s13640-024-00627-2
Hu YDong BHuang KDing LWang WHuang XWang Q(2024)Scene Text Recognition via Dual-path Network with Shape-driven Attention AlignmentACM Transactions on Multimedia Computing, Communications, and Applications10.1145/363351720:4(1-20)Online publication date: 11-Jan-2024
https://dl.acm.org/doi/10.1145/3633517
Jiang YChen KYan WYan XYang GZeng K(2024)Robust Secret Image Sharing Resistant to JPEG Recompression Based on Stable Block ConditionIEEE Transactions on Multimedia10.1109/TMM.2024.340769426(10446-10461)Online publication date: 2024
https://doi.org/10.1109/TMM.2024.3407694
Show More Cited By

Index Terms

Robust Secret Image Sharing Resistant to Noise in Shares
1. Security and privacy
  1. Cryptography
    1. Key management
  2. Security services

Recommendations

An efficient verifiable (t,n)-threshold secret image sharing scheme with ultralight shares
Abstract
A 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-...
Essential secret image sharing approach with same size of meaningful shares
Abstract
Essential Secret Image Sharing (ESIS) is a method to decompose a secret image into two groups of shares, where one group is essential and the other group is non-essential. In this method, recovery of secret image is possible only if threshold ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Multimedia Computing, Communications, and Applications

ACM Transactions on Multimedia Computing, Communications, and Applications Volume 17, Issue 1

February 2021

392 pages

ISSN:1551-6857

EISSN:1551-6865

DOI:10.1145/3453992

Editor:
Alberto Del Bimbo
University of Firenze, Italy

Issue’s Table of Contents

Copyright © 2021 Copyright held by the owner/author(s). Publication rights licensed to ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 April 2021

Accepted: 01 August 2020

Revised: 01 June 2020

Received: 01 January 2020

Published in TOMM Volume 17, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Refereed

Funding Sources

National Natural Science Foundation of China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
750
Total Downloads

Downloads (Last 12 months)318
Downloads (Last 6 weeks)29

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li DWang LJin X(2024)Cartoon copyright recognition method based on character personality actionJournal on Image and Video Processing10.1186/s13640-024-00627-22024:1Online publication date: 24-May-2024
https://dl.acm.org/doi/10.1186/s13640-024-00627-2
Hu YDong BHuang KDing LWang WHuang XWang Q(2024)Scene Text Recognition via Dual-path Network with Shape-driven Attention AlignmentACM Transactions on Multimedia Computing, Communications, and Applications10.1145/363351720:4(1-20)Online publication date: 11-Jan-2024
https://dl.acm.org/doi/10.1145/3633517
Jiang YChen KYan WYan XYang GZeng K(2024)Robust Secret Image Sharing Resistant to JPEG Recompression Based on Stable Block ConditionIEEE Transactions on Multimedia10.1109/TMM.2024.340769426(10446-10461)Online publication date: 2024
https://doi.org/10.1109/TMM.2024.3407694
Tan WDing CWang PGong MJia K(2024)Style Interleaved Learning for Generalizable Person Re-IdentificationIEEE Transactions on Multimedia10.1109/TMM.2023.328387826(1600-1612)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TMM.2023.3283878
Wang RLi LYang GYan XYan W(2024)Secret Cracking and Security Enhancement for the Image Application of CRT-Based Secret SharingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.347726519(9819-9834)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3477265
Singh HJha ISingh Luthra IAnkur (2024)An Analysis of Research on Secret Image Sharing from Bibliometric Perspective2024 1st International Conference on Advances in Computing, Communication and Networking (ICAC2N)10.1109/ICAC2N63387.2024.10895887(1-7)Online publication date: 16-Dec-2024
https://doi.org/10.1109/ICAC2N63387.2024.10895887
Luo SLiu YYan XSun Y(2024)Robust secret image sharing scheme with improved anti-noise capabilitySignal Processing10.1016/j.sigpro.2024.109423219:COnline publication date: 25-Jun-2024
https://dl.acm.org/doi/10.1016/j.sigpro.2024.109423
Luo SLiu YYan XSun Y(2024)Robust secret color image sharing anti-cropping and tampering in sharesJournal of Information Security and Applications10.1016/j.jisa.2024.10386985(103869)Online publication date: Sep-2024
https://doi.org/10.1016/j.jisa.2024.103869
Liu ZZhu GZhang YZhang HKwong S(2024)An efficient cheating-detectable secret image sharing scheme with smaller share sizesJournal of Information Security and Applications10.1016/j.jisa.2024.10370981:COnline publication date: 25-Jun-2024
https://dl.acm.org/doi/10.1016/j.jisa.2024.103709
Maity KMukhopadhyay S(2024)An efficient scheme for secret image sharing through wavelet decomposed audio signalComputers and Electrical Engineering10.1016/j.compeleceng.2024.109131115:COnline publication date: 2-Jul-2024
https://dl.acm.org/doi/10.1016/j.compeleceng.2024.109131
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents