A feasibility paradigmatic of (t n) visual cryptography codification with vitalizing group
IT Skills Show & International Conference on Advancements in Computing Resources, (SSICACR-2017) 15 and 16 February 2017, Alagappa University, Karaikudi, Tamil Nadu, India. International Journal of Computer Science (IJCS) Published by SK Research Group of Companies (SKRGC)
Download this 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.
 M. Naor and A. Shamir, “Visual cryptography,” in Proc. Advances in Cryptography (EUROCRYPT’94), 1995, vol. 950, LNCS, pp. 1– 12.
 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.
 C. N. Yang, “New visual secret sharing schemes using probabilistic method,” Pattern Recognit. Lett., vol. 25, pp. 481–494, Mar. 2004.
 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.
 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.
 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,
 Z. Zhou, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptog-raphy,” IEEE Trans. Image Process., vol. 15, no. 8, pp. 2441–2453,
 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.
 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.
 G. Horng, T. Chen, and D. S. Tsai, “Cheating in visual cryptography,” Designs, Codes, Cryptography, vol. 38, no. 2, pp. 219–236, Feb. 2006.
 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.
 H. Koga, “A general formula of the -threshold visual secret sharing scheme,” in Proc. 8th Int. Conf. Theory and Application of Cryptology and Information Security: Advances in Cryptology, Dec.
 R. Z. Wang, “Region incrementing visual cryptography,” IEEE Signal Process. Lett., vol. 16, no. 8, pp. 659–662, Aug. 2009.
 M. Bose and R. Mukerjee, “Optimal visual cryptographic schemes for general ,” Designs, Codes, Cryptography, vol. 55, no. 1
 C. Blundo, P. D’Arco, A. De Santis, and D. R. Stinson, “Contrast op-timal threshold visual cryptography schemes,”SIAM J. Discrete Math.,vol. 16, no. 2, pp. 224–261, Feb. 2003.
 M. Bose and R. Mukerjee, “Optimal visual cryptographic schemes,” Designs, Codes, Cryptography, vol. 40, no. 3, pp. 255–267
 C. Blundo, A. De Santis, and D. R. Stinson, “On the contrast in visual cryptography schemes,” J. Cryptology, vol. 12, no. 4, pp. 261–289
visual cryptography, Encoding Algorithm, transparencies, probabilistic, dynamic user