Abstract
In traditional visual cryptography schemes (VCSs), pixel expansion remains to be an unsolved challenge. To alleviate the impact of pixel expansion, several colored-black-and-white VCSs, called CBW-VCSs, were proposed in recent years. Although these methods could ease the effect of pixel expansion, the reconstructed image obtained by these methods may also suffer from low contrasts. To address this issue, we propose a contrast-enhanced (k, n) CBW-VCS based on random grids, named (k,n) RG-CBW-VCS, in this article. By applying color random grids, a binary secret image is encrypted into n color shares that have no pixel expansion. When any k1 (k1> k) color shares are collected together, the stacked results of them can be identified as the secret image; whereas the superposition of any k2 (k2< k) color shares shows nothing. Through theoretical analysis and experimental results, we justify the effectiveness of the proposed (k, n) RG-CBW-VCS. Compared with related methods in feature, contrast, and pixel expansion, the results indicate that the proposed method generally achieves better performance.
- [1] . 1979. Safeguarding cryptographic keys. In Proceedings of the 1979 International Workshop on Managing Requirements Knowledge. IEEE, 313–318.Google Scholar
Cross Ref
- [2] . 2006. Visual cryptography schemes with optimal pixel expansion. Theoretical Computer Science 369, 1–3 (2006), 169–182.Google Scholar
Digital Library
- [3] . 1999. On the contrast in visual cryptography schemes. Journal of Cryptology 12, 4 (1999), 261–289.Google Scholar
Digital Library
- [4] . 2009. Visual secret sharing by random grids revisited. Pattern Recognition 42, 9 (2009), 2203–2217.Google Scholar
Digital Library
- [5] . 2011. User-friendly random-grid-based visual secret sharing. IEEE Transactions on Circuits and Systems for Video Technology 21, 11 (2011), 1693–1703.Google Scholar
Digital Library
- [6] . 2011. Efficient multi-secret image sharing based on Boolean operations. Signal Processing 91, 1 (2011), 90–97.Google Scholar
Digital Library
- [7] . 2012. Comment on cheating prevention in visual cryptography. IEEE Transactions on Image Processing 21, 7 (2012), 3319–3323.Google Scholar
Digital Library
- [8] . 2006. Probabilistic visual cryptography schemes. The Computer Journal 49, 1 (2006), 97–107.Google Scholar
Digital Library
- [9] . 2013. Color visual cryptography schemes for black and white secret images. Theoretical Computer Science 510 (2013), 62–86.Google Scholar
Digital Library
- [10] . 2014. On the relation of random grid and deterministic visual cryptography. IEEE Transactions on Information Forensics and Security 9, 4 (2014), 653–665.Google Scholar
Digital Library
- [11] . 2003. Visual cryptography for color images. Pattern Recognition 36, 7 (2003), 1619–1629.Google Scholar
Cross Ref
- [12] . 2013. Block-based progressive visual secret sharing. Information Sciences 233 (2013), 290–304.Google Scholar
Digital Library
- [13] . 2013. Random-grid-based visual cryptography schemes. IEEE Transactions on Circuits and Systems for Video Technology 24, 5 (2013), 733–744.Google Scholar
- [14] . 2006. Cheating prevention in visual cryptography. IEEE Transactions on Image Processing 16, 1 (2006), 36–45.Google Scholar
Cross Ref
- [15] . 2018. Collaborative visual cryptography schemes. IEEE Transactions on Circuits and Systems for Video Technology 28, 5 (2018), 1056–1070.Google Scholar
Cross Ref
- [16] . 2010. Color extended visual cryptography using error diffusion. IEEE Transactions on Image Processing 20, 1 (2010), 132–145.Google Scholar
Digital 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 Scholar
Digital Library
- [18] . 1994. Visual cryptography. In Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques. Springer, 1–12.Google Scholar
- [19] . 1979. How to share a secret. Communications of the ACM 22, 11 (1979), 612–613.Google Scholar
Digital Library
- [20] . 2017. Perfect contrast XOR-based visual cryptography schemes via linear algebra. Designs, Codes and Cryptography 85, 1 (2017), 15–37.Google Scholar
Digital Library
- [21] . 2016. Progressive visual cryptography with unexpanded meaningful shares. ACM Transactions on Multimedia Computing, Communications, and Applications 12, 4 (2016), 1–24.Google Scholar
Digital Library
- [22] . 2006. Efficient visual secret sharing scheme for color images. Pattern Recognition 39, 5 (2006), 866–880.Google Scholar
Digital Library
- [23] . 2012. Visual cryptograms of random grids for general access structures. IEEE Transactions on Circuits and Systems for Video Technology 23, 3 (2012), 414–424.Google Scholar
Digital Library
- [24] . 2011. Optimum pixel expansions for threshold visual secret sharing schemes. IEEE Transactions on Information Forensics and Security 6, 3 (2011), 960–969.Google Scholar
Digital Library
- [25] . 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 Scholar
Digital Library
- [26] . 2007. Sharing multiple secrets in visual cryptography. Pattern Recognition 40, 12 (2007), 3633–3651.Google Scholar
Digital Library
- [27] . 2011. Probabilistic visual secret sharing schemes for grey-scale images and color images. Information Sciences 181, 11 (2011), 2189–2208.Google Scholar
Digital Library
- [28] . 2013. Optimal contrast grayscale visual cryptography schemes with reversing. IEEE Transactions on Information Forensics and Security 8, 12 (2013), 2059–2072.Google Scholar
Digital Library
- [29] . 2019. Random grid based color visual cryptography scheme for black and white secret images with general access structures. Signal Processing: Image Communication 75 (2019), 100–110.Google Scholar
Digital Library
- [30] . 2013. Generalized random grid and its applications in visual cryptography. IEEE Transactions on Information Forensics and Security 8, 9 (2013), 1541–1553.Google Scholar
Digital Library
- [31] . 2013. Improving the visual quality of random grid-based visual secret sharing. Signal Processing 93, 5 (2013), 977–995.Google Scholar
Digital Library
- [32] . 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 Scholar
Digital Library
- [33] . 2020. Probabilistic color visual cryptography schemes for black and white secret images. Journal of Visual Communication and Image Representation 70 (2020), 102793.Google Scholar
Cross Ref
- [34] . 2014. Threshold construction from specific cases in visual cryptography without the pixel expansion. Signal Processing 105 (2014), 389–398.Google Scholar
Cross Ref
- [35] . 2004. New visual secret sharing schemes using probabilistic method. Pattern Recognition Letters 25, 4 (2004), 481–494.Google Scholar
Digital Library
- [36] . 2008. Colored visual cryptography scheme based on additive color mixing. Pattern Recognition 41, 10 (2008), 3114–3129.Google Scholar
Digital Library
- [37] . 2000. New colored visual secret sharing schemes. Designs, Codes and Cryptography 20, 3 (2000), 325–336.Google Scholar
Digital Library
- [38] . 2016. Extended color visual cryptography for black and white secret image. Theoretical Computer Science 609 (2016), 143–161.Google Scholar
Digital Library
- [39] . 2017. k Out of n region-based progressive visual cryptography. IEEE Transactions on Circuits and Systems for Video Technology 29, 1 (2017), 252–262.Google Scholar
Digital Library
- [40] . 2014. A discussion on the relationship between probabilistic visual cryptography and random grid. Information Sciences 278 (2014), 141–173.Google Scholar
Cross Ref
- [41] . 2014. New extended visual cryptography schemes with clearer shadow images. Information Sciences 271 (2014), 246–263.Google Scholar
Cross Ref
Index Terms
Contrast-Enhanced Color Visual Cryptography for (k, n) Threshold Schemes
Recommendations
Random grid based color visual cryptography scheme for black and white secret images with general access structures
AbstractTo reduce the pixel expansion problem in color–black-and-white visual cryptography schemes (CBW-VCSs) and to provide flexible sharing strategy simultaneously, a random grid based CBW-VCS (RG-CBW-VCS) for general access structure (GAS) ...
Highlights- The concept of random grid is extended to color image domain, and XOR operation for color pixels is defined.
Improved Schemes for Visual Cryptography
A (k,n) -threshold visual cryptography scheme ( (k,n) -threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the visual recovery of the secret image, but by inspecting ...
Friendly progressive random-grid-based visual secret sharing with adaptive contrast
A RG-based VSS scheme with friendliness and progressive secret-reconstruction.Theoretic analysis demonstrated its visual quality and security.Contrast-flexibility between reconstructed secrets and logo images is presented. Visual secret sharing (VSS) ...






Comments