Zuquan Liu
Abstract
Visual secret sharing (VSS) is a new technique for sharing a binary image into multiple shadows. For VSS, the original image can be reconstructed from the shadows in any qualified set, but cannot be reconstructed from those in any forbidden set. In most traditional VSS schemes, the shadows held by participants have the same importance. However, in practice, a certain number of shadows are given a higher importance due to the privileges of their owners. In this article, a novel (t, s, k, n)-threshold VSS scheme is proposed based on access structure partition. First, we construct the basis matrix of the proposed (t, s, k, n)-threshold VSS scheme by utilizing a new access structure partition method and sub-access structure merging method. Then, the secret image is shared by the basis matrix as n shadows, which are divided into s essential shadows and n-s non-essential shadows. To reconstruct the secret image, k or more shadows should be collected, which include at least t essential shadows; otherwise, no information about the secret image can be obtained. Compared with related schemes, our scheme achieves a smaller shadow size and a higher visual quality of the reconstructed image. Theoretical analysis and experiments indicate the effectiveness of the proposed scheme.
- Avishek Adhikari. 2014. Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images. Des. Codes Cryptogr. 73, 3 (2014), 865--895.Google Scholar
Digital Library
- S. Arumugam, R. Lakshmanan, and Atulya K. Nagar. 2014. On (k, n)*-visual cryptography scheme. Des. Codes Cryptogr. 71, 1 (2014), 153--162.Google ScholarDigital Library
- Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, and Douglas R. Stinson. 1996. Visual cryptography for general access structures. Inf. Comput. 129, 2 (1996), 86--106.Google ScholarDigital Library
- Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, and Douglas R. Stinson. 2001. Extended capabilities for visual cryptography. Theor. Comput. Sci. 250, 1--2 (2001), 143--161.Google ScholarDigital Library
- Carlo Blundo, Stelvio Cimato, and Alfredo De Santis. 2006. Visual cryptography schemes with optimal pixel expansion. Theor. Comput. Sci. 369, 1--3 (2006), 169--182.Google ScholarDigital Library
- Carlo Blundo, Alfredo De Santis, and Moni Naor. 2000. Visual cryptography for grey level images. Inf. Process. Lett. 75, 6 (2000), 255--259.Google ScholarDigital Library
- Carlo Blundo, Alfredo De Santis, and Douglas R. Stinson. 1999. On the contrast in visual cryptography schemes. J. Cryptol. 12, 4 (1999), 261--289.Google ScholarDigital Library
- Chien-Chang Chen. 2018. Essential secret image sharing scheme with equal-sized shadows generation. J. Visual Commun. Image Represent. 52 (2018), 143--150.Google ScholarDigital Library
- Chien-Chang Chen and Shih-Chang Chen. 2016. Two-layered structure for optimally essential secret image sharing scheme. J. Visual Commun. Image Represent. 38 (2016), 595--601.Google ScholarDigital Library
- Stelvio Cimato, Roberto De Prisco, and Alfredo De Santis. 2005. Optimal colored threshold visual cryptography schemes. Des. Codes Cryptogr. 35, 3 (2005), 311--335.Google ScholarDigital Library
- Stelvio Cimato, Roberto De Prisco, and Alfredo De Santis. 2006. Probabilistic visual cryptography schemes. Comput. J. 49, 1 (2006), 97--107.Google ScholarDigital Library
- Stefan Droste. 1996. New results on visual cryptography. In Proceedings of the Annual International Cryptology Conference. Springer, 401--415.Google ScholarCross Ref
- Zhengxin Fu, Yuqiao Cheng, and Bin Yu. 2019. Perfect recovery of XOR-based visual cryptography scheme. Multimedia Tools Appl. 78, 2 (2019), 2367--2384.Google ScholarDigital Library
- Zhengxin Fu and Bin Yu. 2014. Optimal pixel expansion of deterministic visual cryptography scheme. Multimedia Tools Appl. 73, 3 (2014), 1177--1193.Google ScholarDigital Library
- Teng Guo, Feng Liu, ChuanKun Wu, YaWei Ren, and Wen Wang. 2013. On (k, n) visual cryptography scheme with t essential parties. In Proceedings of the International Conference on Information Theoretic Security. Springer, 56--68.Google Scholar
- Young-Chang Hou. 2003. Visual cryptography for color images. Pattern Recogn. 36, 7 (2003), 1619--1629.Google ScholarCross Ref
- Young-Chang Hou, Shih-Chieh Wei, and Chia-Yin Lin. 2013. Random-grid-based visual cryptography schemes. IEEE Trans. Circ. Syst. Video Technol. 24, 5 (2013), 733--744.Google Scholar
- Hao Hu, Gang Shen, Yuling Liu, Zhengxin Fu, and Bin Yu. 2019. Improved schemes for visual secret sharing based on random grids. Multimedia Tools Appl. 78, 9 (2019), 12055--12082.Google ScholarDigital Library
- Oded Kafri and Eliezer Keren. 1987. Encryption of pictures and shapes by random grids. Opt. Lett. 12, 6 (1987), 377--379.Google ScholarCross Ref
- Kai-Hui Lee and Pei-Ling Chiu. 2011. An extended visual cryptography algorithm for general access structures. IEEE Trans. Inf. Forens. Secur. 7, 1 (2011), 219--229.Google ScholarDigital Library
- Peng Li and Zuquan Liu. 2017. A novel visual cryptography scheme with different importance of shadows. In Proceedings of the International Workshop on Digital Watermarking. Springer, 365--377.Google ScholarCross Ref
- Peng Li and Zuquan Liu. 2018. An improved essential secret image sharing scheme with smaller shadow size. Int. J. Dig. Crime Forens. 10, 3 (2018), 78--94.Google ScholarDigital Library
- Peng Li, Zuquan Liu, and Ching-Nung Yang. 2018. A construction method of (t, k, n)-essential secret image sharing scheme. Sign. Process.: Image Commun. 65 (2018), 210--220.Google ScholarCross Ref
- Peng Li, Ching-Nung Yang, Chih-Cheng Wu, Qian Kong, and Yanpeng Ma. 2013. Essential secret image sharing scheme with different importance of shadows. J. Visual Commun. Image Represent. 24, 7 (2013), 1106--1114.Google ScholarDigital Library
- Peng Li, Ching-Nung Yang, and Zhili Zhou. 2016. Essential secret image sharing scheme with the same size of shadows. Digital Sign. Process. 50 (2016), 51--60.Google ScholarDigital Library
- Feng Liu, Chuankun Wu, and Xijun Lin. 2009. Step construction of visual cryptography schemes. IEEE Trans. Inf. Forens. Secur. 5, 1 (2009), 27--38.Google Scholar
- Moni Naor and Adi Shamir. 1994. Visual cryptography. In Workshop on the Theory and Application of Cryptographic Techniques. Springer, 1--12.Google Scholar
- Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612--613.Google ScholarDigital Library
- Gang Shen, Feng Liu, Zhengxin Fu, and Bin Yu. 2017. Perfect contrast XOR-based visual cryptography schemes via linear algebra. Des. Codes Cryptogr. 85, 1 (2017), 15--37.Google ScholarDigital Library
- Shivendra Shivani and Suneeta Agarwal. 2016. Progressive visual cryptography with unexpanded meaningful shares. ACM Trans. Multimedia Comput. Commun. Appl. 12, 4 (2016), 1--24.Google ScholarDigital Library
- Shyong Jian Shyu and Ming Chiang Chen. 2011. Optimum pixel expansions for threshold visual secret sharing schemes. IEEE Trans. Inf. Forens. Secur. 6, 3 (2011), 960--969.Google ScholarDigital Library
- Shyong Jian Shyu and Ming Chiang Chen. 2015. Minimizing pixel expansion in visual cryptographic scheme for general access structures. IEEE Trans. Circ. Syst. Video Technol. 25, 9 (2015), 1557--1561.Google ScholarDigital Library
- Daoshun Wang, Feng Yi, and Xiaobo Li. 2009. On general construction for extended visual cryptography schemes. Pattern Recogn. 42, 11 (2009), 3071--3082.Google ScholarDigital Library
- Xiaotian Wu, Duanhao Ou, Lu Dai, and Wei Sun. 2013. XOR-based meaningful visual secret sharing by generalized random grids. In Proceedings of the 1st ACM Workshop on Information Hiding and Multimedia Security. ACM, 181--190.Google ScholarDigital Library
- Xiaotian Wu and Wei Sun. 2013. Generalized random grid and its applications in visual cryptography. IEEE Trans. Inf. Forens. Secur. 8, 9 (2013), 1541--1553.Google ScholarDigital Library
- Xuehu Yan, Xin Liu, and Ching-Nung Yang. 2018. An enhanced threshold visual secret sharing based on random grids. J. Real-Time Image Process. 14, 1 (2018), 61--73.Google ScholarCross Ref
- Ching-Nung Yang. 2004. New visual secret sharing schemes using probabilistic method. Pattern Recogn. Lett. 25, 4 (2004), 481--494.Google ScholarDigital Library
- Ching-Nung Yang, Peng Li, Chih-Cheng Wu, and Song-Ruei Cai. 2015. Reducing shadow size in essential secret image sharing by conjunctive hierarchical approach. Sign. Process.: Image Commun. 31 (2015), 1--9.Google ScholarDigital Library
Index Terms
- A Novel (t, s, k, n)-Threshold Visual Secret Sharing Scheme Based on Access Structure Partition
Recommendations
An Efficient Multi-secret Sharing Scheme with the Quasi-threshold Multipartite Access Structure
NSWCTC '09: Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02In real world, there are many important applications for the secret sharing with the quasi-threshold multipartite access structure. But there was still not a very efficient scheme proposed in the past. In this paper, we combine the multi-secret sharing ...
Ideal Perfect Multilevel Threshold Secret Sharing Scheme
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 02Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate ...
Strong (n,t,n) verifiable secret sharing scheme
A (t,n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t,n) secret sharing scheme ...
Comments