Ching-Nung Yang
Skip Abstract Section
Abstract
Recently, three visual cryptography schemes with t-error-correcting capability (VCSs-tEC) were introduced for preventing the shadows carrying additional information from being corrupted by noise interference. However, the concerns on VCS-tEC, such as the average amount of carrying information, decoding of information from shadows, and the demonstration way of a secret, should be considered and improved. In this article, two schemes, namely the (k, n) probabilistic VCS-tEC (PVCS-tEC) and the (2, n) deterministic VCS-tEC (DVCS-tEC), are proposed. The concept of probabilistic VCS is combined with the Bose-Chaudhuri-Hocquenghem code (BCH code) for designing the (k, n) PVCS-tEC. Furthermore, some constant-weight BCH codewords are adopted to build the (2, n)-DVCS-tEC. Comprehensive results and experiments are demonstrated to clarify the enhancement of information-carrying and decoding by the two proposed methods.
- [1] . 1982. Theory of unidirectional error correcting/detecting codes. IEEE Transactions on Computers6 (1982), 521–530.Google Scholar
Digital Library
- [2] . 2022. Secret sharing based reversible data hiding in encrypted images with multiple data-hiders. IEEE Transactions on Dependable and Secure Computing 19, 2 (2022), 978–991.Google Scholar
- [3] . 2006. Probabilistic visual cryptography schemes. Computer Journal 49, 1 (2006), 97–107.Google ScholarDigital Library
- [4] . 2002. Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels. Designs, Codes and Cryptography 25, 1 (2002), 15–61.Google ScholarDigital Library
- [5] . 2003. Visual cryptography for color images. Pattern Recognition 36, 7 (2003), 1619–1629.Google ScholarCross Ref
- [6] . 2022. A perfect secret sharing scheme for general access structures. Information Sciences 595 (2022), 54–69.Google ScholarDigital Library
- [7] . 2018. Collaborative visual cryptography schemes. IEEE Transactions on Circuits and Systems for Video Technology 28, 5 (2018), 1056–1070.Google ScholarCross Ref
- [8] . 2021. Privacy-preserving decentralized learning framework for healthcare system. ACM Transactions on Multimedia Computing, Communications, and Applications 17, 2s (2021), 1–24.Google ScholarDigital Library
- [9] . 1990. On symmetric error correcting and all unidirectional error detecting codes. IEEE Transactions on Computers 39, 6 (1990), 752–761.Google ScholarDigital Library
- [10] . 1996. On the analysis and design of group theoretical t-syEC/AUED codes. IEEE Transactions on Computers 45, 1 (1996), 103–108.Google ScholarDigital Library
- [11] . 2015. Image enhancement in encrypted domain over cloud. ACM Transactions on Multimedia Computing, Communications, and Applications 11, 3 (2015), 1–24.Google ScholarDigital Library
- [12] . 2018. A construction method of (t, k, n)-essential secret image sharing scheme. Signal Processing: Image Communication 65 (2018), 210–220.Google ScholarCross Ref
- [13] . 2012. Improvements of a two-in-one image secret sharing scheme based on gray mixing model. Journal of Visual Communication and Image Representation 23, 3 (2012), 441–453.Google ScholarDigital Library
- [14] . 2007. VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches. Pattern Recognition 40, 12 (2007), 3652–3666.Google ScholarDigital Library
- [15] . 2017. Scalable secret image sharing scheme with essential shadows. Signal Processing: Image Communication 58 (2017), 49–55.Google ScholarDigital Library
- [16] . 2022. Contrast-enhanced color visual cryptography for (k, n) threshold schemes. ACM Transactions on Multimedia Computing, Communications and Applications 18, 3s (2022), 1–16.Google ScholarDigital Library
- [17] . 2020. A novel (t, s, k, n)-threshold visual secret sharing scheme based on access structure partition. ACM Transactions on Multimedia Computing, Communications, and Applications 16, 4 (2020), 1–21.Google ScholarDigital Library
- [18] . 1995. Visual cryptography. Lecture Notes in Computer Science 950, 1 (1995), 1–12.Google Scholar
- [19] . 1960. Encoding and error-correction procedures for the bose-chaudhuri codes. IRE Transactions on Information Theory 6, 4 (1960), 459–470.Google ScholarCross Ref
- [20] . 2023. A secret JPEG image sharing method over GF (\(2^M\)) galois fields. IEEE Transactions on Circuits and Systems for Video Technology 33, 6 (2023), 3030–3042.Google ScholarDigital Library
- [21] . 1979. How to share a secret. Communications of the ACM 22, 11 (1979), 612–613.Google ScholarDigital Library
- [22] . 2017. Perfect contrast XOR-based visual cryptography schemes via linear algebra. Designs, Codes and Cryptography 85, 1 (2017), 15–37.Google ScholarDigital Library
- [23] . 2015. Minimizing pixel expansion in visual cryptographic scheme for general access structures. IEEE Transactions on Circuits and Systems for Video Technology 25, 9 (2015), 1557–1561.Google ScholarDigital Library
- [24] . 2002. Secret image sharing. Computers & Graphics 26, 5 (2002), 765–770.Google ScholarCross Ref
- [25] . 1997. Constructions and properties of k out of n visual secret sharing schemes. Designs, Codes and Cryptography 11, 2 (1997), 179–196.Google ScholarDigital Library
- [26] . 2012. Image hatching for visual cryptography. ACM Transactions on Multimedia Computing, Communications, and Applications 8, 2S (2012), 32.Google ScholarDigital Library
- [27] . 2019. A combination of color-black-and-white visual cryptography and polynomial based secret image sharing. Journal of Visual Communication and Image Representation 61 (2019), 74–84.Google ScholarDigital Library
- [28] . 2023. Boolean-based two-in-one secret image sharing by adaptive pixel grouping. ACM Transactions on Multimedia Computing, Communications and Applications 19, 1 (2023), 1–23.Google ScholarDigital Library
- [29] . 2023. STR: Secure computation on additive shares using the share-transform-reveal strategy. IEEE Transactions on Computers (2023).
DOI: Google ScholarDigital Library - [30] . 2023. RDH-DES: Reversible data hiding over distributed encrypted-image servers based on secret sharing. ACM Transactions on Multimedia Computing, Communications and Applications 19, 1 (2023), 1–19.Google ScholarDigital Library
- [31] . 2021. Robust secret image sharing resistant to noise in shares. ACM Transactions on Multimedia Computing, Communications, and Applications 17, 1 (2021), 1–22.Google ScholarDigital Library
- [32] . 2017. Contrast-improved visual secret sharing based on random grid for general access structure. Digital Signal Processing 71 (2017), 36–45.Google ScholarDigital Library
- [33] . 2020. Reversible image secret sharing. IEEE Transactions on Information Forensics and Security 15 (2020), 3848–3858.Google ScholarDigital Library
- [34] . 2004. New visual secret sharing schemes using probabilistic method. Pattern Recognition Letters 25, 4 (2004), 486–494.Google ScholarDigital Library
- [35] . 2014. Property analysis of XOR-based visual cryptography. IEEE Transactions on Circuits and Systems for Video Technology 24, 2 (2014), 189–197.Google ScholarDigital Library
- [36] . 2014. A discussion on the relationship between probabilistic visual cryptography and random grid. Information Sciences 278 (2014), 141–173.Google ScholarCross Ref
- [37] . 2021. On the analysis and design of visual cryptography with error correcting capability. IEEE Transactions on Circuits and Systems for Video Technology 31, 6 (2021), 2465–2479.Google ScholarCross Ref
Index Terms
- Enhancement of Information Carrying and Decoding for Visual Cryptography with Error Correction
Recommendations
A novel approach of error detection and correction for efficient energy in wireless networks
This paper presents a novel linear error detection and correction approach for single and multiple bit error codes called low complexity parity check (LCPC) code. The LCPC code detects and corrects consecutive and non-consecutive bit errors. It can be ...
Cheating in Visual Cryptography
A secret sharing scheme allows a secret to be shared among a set of participants, P , such that only authorized subsets of P can recover the secret, but any unauthorized subset cannot recover the secret. In 1995, Naor and Shamir proposed a variant of ...
Sharing more information in gray visual cryptography scheme
Visual cryptography scheme (VCS) shares a binary secret image into several binary shadows, and the secret image can be visually revealed by stacking qualified shadows without computation. From the point of view of sharing secret information, VCS is not ...
Comments