International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 5 | Number 2 | Year 2013 | Article Id. IJCTT-V5N5P142 | DOI : https://doi.org/10.14445/22312803/IJCTT-V5N5P142

A Presumption Mold of Visual Cryptography Design with Dynamic Groups

Sudhakar Badikala , Gowthami Janapatla

Citation :

Sudhakar Badikala , Gowthami Janapatla, "A Presumption Mold of Visual Cryptography Design with Dynamic Groups," International Journal of Computer Trends and Technology (IJCTT), vol. 5, no. 2, pp. 225-229, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V5N5P142

Abstract

Visual cryptography is a secret sharing scheme where an image is encoded into transparencies. The Secret information can be revealed from the encoded image only when the correct set of images is given as an input and if the input is not matching then the secret information cannot be revealed. We will introduce a scheme which will dynamically add a user to specific group and then based on the information being shared that group related users can retrieve the information. To cut down the overhead of generating and distributing transparencies in user changes, this paper implements a Visual Cryptography scheme. The proposed scheme not provides security to the data but also takes care of discrepancies an extended VC scheme based on basis matrices and a presumption mold is proposed. Apart from the Visual Cryptography scheme we also show the image processing i.e. sending the information for communication along with the image in fact text being written on the image.

Keywords

Secret Sharing, Image processing, Visual Cryptography (VC), Presumption Mold.

References

[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 cryptography,” IEICE Trans. Fundam. Electron., Commun., Comput. Sci.,vol. 82, pp. 2172–2177, Oct. 1999.
[3]C. N. Yang, “New visual secret sharing schemes using presumption 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 expansion,”J. Vis. Commun. Image Represent., vol. 21, pp. 900–916, Nov.2010.
[5]G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Visual cryptography for general access structures,” Inf. Computat., vol. 129, no. 2, pp. 86–106, Sep. 1996.
[6]F. Liu, C. Wu, and X. Lin, “Step onstruction of visual cryptography schemes,” IEEE Trans. Inf. Forensics Security, vol. 5, no. 1, pp. 27–38, Mar. 2010.
[7]Z. Zhou, G. R. Arce, and G. Di Crescenzo, “Halftone visual cryptography,” IEEE Trans. Image Process., vol. 15, no. 8, pp. 2441–2453, Aug. 2006.