Extending the Visual Cryptography Algorithm Without Removing Cover Images

Dr.V.R.Anitha; Dilip kumar Kotthapalli

doi:https://doi.org/10.14445/22315381/IJETT-V4I4P356

Research Article | Open Access | Download PDF

Volume 4 | Issue 4 | Year 2013 | Article Id. IJETT-V4I4P356 | DOI : https://doi.org/10.14445/22315381/IJETT-V4I4P356

Extending the Visual Cryptography Algorithm Without Removing Cover Images

Dr.V.R.Anitha , Dilip kumar Kotthapalli

Citation :

Dr.V.R.Anitha , Dilip kumar Kotthapalli, "Extending the Visual Cryptography Algorithm Without Removing Cover Images," International Journal of Engineering Trends and Technology (IJETT), vol. 4, no. 4, pp. 1288-1291, 2013. Crossref, https://doi.org/10.14445/22315381/IJETT-V4I4P356

Abstract

Visual cryptography is a simple and powerful method which can provide high security for confidential information. This technique generate noise - like random pixels on share imag es to hide secret information which on overlay decrypt the information this technique is known as conventional visual secret sharing schemes. It suffers a management problem, because of which dealers cannot visually identify each share. This problem is sol ved by the extended visual cryptography scheme (EVCS), which adds a meaningful cover image in each share. But while removing the extra cover image it produces extra noise or degrades the hidden image quality. Hence we are Extending the visual cryptography algorithm without removing cover images where it reduces pixel expan sion problem and shares match duration

Keywords

Extended visual cryptography (EVC), pixel expansion problem, shares synchronization, general access structure

References

[1] M . Naor and A. Shamir, “Visual cryptography,” in Proc. Advances in Cryptology (Eurprocrypt’94) , 1994, pp. 1 – 12.
[2] E.R.Verheul and H. C. A. v. Tilborg, “Constructions and properties of k - out - of - n visual secret sharing schemes,” Designs Codes Crypto. , vol. 1 1, pp. 179 – 196, 1997.
[3] H. Koga, “A general formula of the (t,n) - threshold visual secret sharing scheme,” in Proc. Advances in Cryptology (Asiacrypt) , 2002, pp. 328 – 345.
[4] Gamil R.S. Qaid and Sanjay N. Talbar,’’Encryption and Decryption of Digital Im age Using Color signal ” IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 2, No 2, March 2012
[5] C. Blundo, S. Cimato, and A. D. Santis, “Visual cryptography schemes with optimal pixel expansion,” Theor. Comput. Sci. , vol. 369, pp.169 – 182, 2006.
[6] D. Wang, L. Zhang, N. Ma, and X. Li, “Two secret sharing schemes based on boolean operations,” Pattern Recognit. , vol. 40, pp. 2776 – 2785, 2007.
[7] G. Ateniese, C. Blundo, A. D. Santis, and D. R. Stinson, “Visual cryptography for general acc ess structures,” Inform. Comput. , vol. 129, pp. 86 – 106, 1996.
[8] C. S. Hsu, S. F. Tu, and Y. C. Hou, “An optimization model for visual cryptography schemes with unexpanded shares,” Found. Intelligent Syst., LNAI , vol. 4203, pp. 58 – 67, 2006.
[9] G. Atenies e, C. Blundo, A. D. Santis, and D. R. Stinson, “Extended capabilities for visual cryptography,” Theor. Comput. Sci. , vol. 250, pp. 143 – 161, 2001