International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 11, No. 11, 8 Nov. 2019
Cover page and Table of Contents: PDF (size: 748KB)
An Efficient (n, n) Visual Secret Image Sharing using Random Grids with XOR Recovery
Full Text (PDF, 748KB), PP.14-20
Views: 0 Downloads: 0
Author(s)
Ram Gopal Sharma
1,*
Hitendra Garg
2
Priti Dimri
3
Index Terms
Visual Secret Image Sharing, Visual Cryptography, Contrast, Random grids
Abstract
Visual cryptography by name itself suggests cryptography related to images. It is a branch of cryptography that deals with the encryption and decryption of images. Visual cryptography demonstrates a visual secret sharing scheme in which an image has been divided into n shares and original image can be decrypt with these shares without / less computational efforts. This paper proposed an efficient (n, n) visual secret image sharing method using random grids. This scheme gives the complete retrieval of secret image using XOR stacking without the need of a codebook. The Random Grid based Visual Cryptography results no pixel expansion. The proposed method works for (shares) for retrieval of original image. Experimental results demonstrate that the proposed method produces better results in terms of simplicity, visual quality and performance.
Cite This Paper
Ram Gopal Sharma, Hitendra Garg, Priti Dimri, "An Efficient (n, n) Visual Secret Image Sharing using Random Grids with XOR Recovery", International Journal of Computer Network and Information Security(IJCNIS), Vol.11, No.11, pp.14-20, 2019. DOI:10.5815/ijcnis.2019.11.02
Reference
[1]Naor, M., & Shamir, A. (1995). Visual cryptography. Advances in Cryptology EUROCRYPT’94 Lecture Notes in Computer Science. In Workshop on the Theory and Application of Cryptographic Techniques, May 9C12 (pp. 1-12).
[2]Ateniese, G., Blundo, C., De Santis, A., & Stinson, D. R. (1996). Visual cryptography for general access structures. Information and Computation, 129(2), 86-106.
[3]Ito, R., Kuwakado, H., & Tanaka, H. (1999). Image size invariant visual cryptography. IEICE transactions on fundamentals of electronics, communications and computer sciences, 82(10), 2172-2177.
[4]Kafri, O., & Keren, E. (1987). Encryption of pictures and shapes by random grids. Optics letters, 12(6), 377-379.
[5]Shyu, S. J. (2007). Image encryption by random grids. Pattern Recognition, 40(3), 1014-1031.
[6]Shyu, S. J. (2009). Image encryption by multiple random grids. Pattern Recognition, 42(7), 1582-1596.
[7]Chen, T. H., Tsao, K. H., & Yang, Y. T. (2009). Friendly color visual secret sharing by random grids. Fundamenta Informaticae, 96(1-2), 61-70.
[8]Chen, T. H., & Tsao, K. H. (2011). User-friendly random-grid-based visual secret sharing. IEEE Transactions on Circuits and Systems for Video Technology, 21(11), 1693-1703.
[9]Chen, T. H., & Tsao, K. H. (2011). Threshold visual secret sharing by random grids. Journal of Systems and Software, 84(7), 1197-1208.
[10]Wu, X., Ou, D., Dai, L., & Sun, W. (2013, June). XOR-based meaningful visual secret sharing by generalized random grids. In Proceedings of the first ACM workshop on Information hiding and multimedia security (pp. 181-190). ACM.
[11]Wu, X., & Sun, W. (2013). Improving the visual quality of random grid-based visual secret sharing. Signal Processing, 93(5), 977-995.
[12]Wu, X., & Sun, W. (2013). Generalized random grid and its applications in visual cryptography. IEEE Transactions on Information Forensics and Security, 8(9), 1541-1553.
[13]Hou, Y. C., Wei, S. C., & Lin, C. Y. (2014). Random-grid-based visual cryptography schemes. IEEE Trans. Circuits Syst. Video Techn., 24(5), 733-744.
[14]Yang, C. N., & Wang, D. S. (2014). Property analysis of XOR-based visual cryptography. IEEE transactions on circuits and systems for video technology, 24(2), 189-197.
[15]Hou, Y. C., Quan, Z. Y., & Tsai, C. F. (2015). A privilege-based visual secret sharing model. Journal of Visual Communication and Image Representation, 33, 358-367.
[16]Ou, D., Sun, W., & Wu, X. (2015). Non-expansible XOR-based visual cryptography scheme with meaningful shares. Signal Processing, 108, 604-621.
[17]Yan, X., Wang, S., Niu, X., & Yang, C. N. (2015). Random grid-based visual secret sharing with multiple decryptions. Journal of Visual Communication and Image Representation, 26, 94-104.
[18]Yan, X., Wang, S., El-Latif, A. A. A., & Niu, X. (2015). Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery. Multimedia Tools and Applications, 74(9), 3231-3252.
[19]Yan, X., Lu, Y., Huang, H., Liu, L., & Wan, S. (2016, August). Quality-adaptive threshold visual secret sharing by random grids. In Signal and Image Processing (ICSIP), IEEE International Conference on (pp. 323-327). IEEE.
[20]Chiu, P. L., & Lee, K. H. (2016, October). An XOR-based progressive visual cryptography with meaningful shares. In Computer Communication and the Internet (ICCCI), 2016 IEEE International Conference on (pp. 362-365). IEEE.
[21]Chao, H. C., & Fan, T. Y. (2017). XOR-based progressive visual secret sharing using generalized random grids. Displays, 49, 6-15.
[22]Yan, X., Liu, X., & Yang, C. N. (2018). An enhanced threshold visual secret sharing based on random grids. Journal of real-time image processing, 14(1), 61-73.
[23]Sharma, R. G., Dimri, P., & Garg, H. (2018). Visual cryptographic techniques for secret image sharing: a review. Information Security Journal: A Global Perspective, 27(5-6), 241-259.