Abstract
Visual cryptography schemes suffer from the drawback of large pixel expansion of shared images and bad visual quality of the recovered image. To provide secrecy, we go for pixel expansion and increasing the number of shares, this causes the bad visual quality of the recovered image. In this paper, we construct (n, n)-VCS and OR and XOR operations are used for share creation and stacking process, which proves better in contrast and pixel expansion. The proposed method uses an additional matrix to increase the secrecy of the message in XOR operation. The use of visual cryptography is explored to preserve the privacy of an image by decomposing the original image into two shares (known as sheets) that are stored in separate database servers (one with user and one with server) such that the original image can be revealed only when both are simultaneously available; the individual sheet images do not reveal the identity of the original image. Once the original image is revealed to the user it can be used as the password.
References
M.Naor and A.Shamir, “Visual cryptography,” in EUROCRYPT’94, Berlin, 1995, vol. LNCS 950, pp. 1–12, Springer-Verlag.
G.Ateniese, C Blundo, A.De Santis, and D.R.Stinson, “Visual cryptography for general access structures,” Inf. Computation, vol. 129, pp. 86–106, 1996.
P. Tuyls, H. D. L. Hollmann, J. H. van Lint, and L. Tolhuizen,“Xorbased
visual cryptography schemes,” Designs Codes and Cryptography,vol. 37, pp. 169–186, 2005.
D.Stinson, Visual cryptography and threshold schemes,Potentials, IEEE, 1999, Vol. 18 Issue: 1, pp. 13 -16.
Feng Liu, Chuankun Wu, Senior Member, IEEE, and Xijun Lin, “Step construction of visual cryptography schemes” vol. 5, March 2010.