A feasibility paradigmatic of (t n) visual cryptography codification with vitalizing group

Alagappa Institute of Skill Development & Computer Centre,Alagappa University, Karaikudi, India.15 -16 February 2017. IT Skills Show & International Conference on Advancements In Computing Resources (SSICACR-2017)

Format: Volume 5, Issue 1, No 23, 2017

Copyright: All Rights Reserved ©2017

Year of Publication: 2017

Author: K.Nithya Kalyani


View PDF Format


The (t,n) visual cryptography (VC) is a secret sharing scheme where a secret image is encoded into n transparencies, and the stacking of any out of transparencies reveals the secret image. The stacking of (t-1) or fewer transparencies is unable to extract any information about the secret. This project discusses the additions and deletions of users in a dynamic user group. To reduce the overhead of generating and distributing transparencies in user changes, this project proposes a (t,n) VC scheme with unlimited n based on the probabilistic model. The proposed scheme allows n to change dynamically in order to include new transparencies without regenerating and redistributing the original transparencies. Specifically, an extended VC scheme based on basis matrices and a probabilistic model is proposed. An equation is derived from the fundamental definitions of the (t,n) VC scheme, and then the (t,∞) VC scheme achieving maximal contrast can be designed by using the derived equation. The maximal contrasts with t=2 to 6 are explicitly solved in this project.


[1] M. Naor and A. Shamir, “Visual cryptography,” in Proc. Advances in Cryptography (EUROCRYPT’94), 1995, vol. 950, LNCS, pp. 1–12. [2] R. Ito, H. Kuwakado, and H. Tanaka, “Image size invariant visual cryp-tography,” IEICE Trans. Fundam. Electron., Commun., Comput. Sci.,vol. 82, pp. 2172–2177, Oct. 1999. [3] C. N. Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognit. Lett., vol. 25, pp. 481–494, Mar. 2004. [4] S. J. Lin, S. K. Chen, and J. C. Lin, “Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expan-sion,” J. Vis. Commun. Image Represent., vol. 21, pp. 900–916, Nov. [5] G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Visual cryp-tography for general access structures,” Inf. Computat., vol. 129, no. 2, pp. 86–106, Sep. 1996. [6] F. Liu, C. Wu, and X. Lin, “Step construction of visual cryptography schemes,” IEEE Trans. Inf. Forensics Security, vol. 5, no. 1, pp. 27–38, [7] Z. Zhou, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptog-raphy,” IEEE Trans. Image Process., vol. 15, no. 8, pp. 2441–2453, [8] Z. Wang, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptog- raphy via error diffusion,” IEEE Trans. Inf. Forensics Security, vol. 4,no. 3, pp. 383–396, Sep. 2009. [9] F. Liu, C. K. Wu, and X. J. Lin, “Colour visual cryptography schemes,” IET Inf. Security, vol. 2, no. 4, pp. 151–165, Dec. 2008. [10] G. Horng, T. Chen, and D. S. Tsai, “Cheating in visual cryptography,” Designs, Codes, Cryptography, vol. 38, no. 2, pp. 219–236, Feb. 2006. [11] C. M. Hu and W. G. Tzeng, “Cheating prevention in visual cryptog- raphy,” IEEE Trans. Image Process., vol. 16, no. 1, pp. 36–45, Jan.


visual cryptography, Encoding Algorithm, transparencies, probabilistic, dynamic user

This work is licensed under a Creative Commons Attribution 3.0 Unported License.   

Facebook IconYouTube IconTwitter IconVisit Our Blog