Expansion-Free Grayscale Image Sharing Using Meaningful Share Images

Article Preview

Abstract:

Since Naor and Shamir introduced visual cryptography in 1994, numerous image sharing techniques have been proposed to protect the security of binary, gray, and color images. However, only few of them focus on grayscale image sharing. Because the size of the share images are usually very large, an image sharing method that can create share images with the same size as that of the secret image (expansion free) is more attractive. This study aims to propose a grayscale image sharing method to achieve the purposes of free expansion and meaningful image sharing simultaneously. Experimental results show that two meaningful share images can be effectively created by the proposed share image creation process. Moreover, the original grayscale secret image can be correctly decoded by the proposed secret image retrieval process.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3413-3417

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. Naor and A. Shamir, Visual Cryptography in Advances in Cryptology, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995, pp.1-12.

DOI: 10.1007/bfb0053419

Google Scholar

[2] J.B. Feng, H.C. Wu, C.S. Tsai, Y.F. Chang and Y.P. Chu, Visual secret sharing for multiple secrets, Pattern Recognition. 41 (2008) 3572-3581.

DOI: 10.1016/j.patcog.2008.05.031

Google Scholar

[3] C.C. Chang, C.C. Lin, T.H. Ngan Le and H.B. Le, Sharing a verifiable secret image using two shadows, Pattern Recognition. 42 (2009) 3097-3114.

DOI: 10.1016/j.patcog.2009.04.012

Google Scholar

[4] C. Blundo, D. Santis. A, and D.R. Stinson, On the contrast in visual cryptography schemes, Journal of Cryptology. 12 (1999) 261-289.

DOI: 10.1007/s001459900057

Google Scholar

[5] C. C. Thien and J. C. Lin, Secret image sharing, Computer & Graphics. 26 (2002) 765-770.

DOI: 10.1016/s0097-8493(02)00131-0

Google Scholar

[6] O. Kafri and E. Keren, Encryption of pictures and shapes by random grids, Optics Letters. 12 (1987) 377-379.

DOI: 10.1364/ol.12.000377

Google Scholar

[7] R. Ito, H. Kuwakado, and H. Tanaka, Image size invariant visual cryptography, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 82 (1999) 2172-2177.

Google Scholar

[8] S. J. Shyu, Efficient visual secret sharing scheme for color images, Pattern Recognition. 39 (2006) 886-880.

DOI: 10.1016/j.patcog.2005.06.010

Google Scholar

[9] H. K. Tso, Sharing secret image using section encoding, The Imaging Science Journal. 58 (2010) 32-36.

DOI: 10.1179/136821909x12581187859899

Google Scholar

[10] R. Lukac and K.N. Plataniotis, Bit-level based secret sharing for image encryption, Pattern Recognition. 38 (2005) 767-772.

DOI: 10.1016/j.patcog.2004.11.010

Google Scholar

[11] W.P. Fang, Friendly progressive visual secret sharing, Pattern Recognition. 41 (2008) 1410-1414.

DOI: 10.1016/j.patcog.2007.09.004

Google Scholar

[12] G. Voyatzis and I.Pitas, Application of toral automorphism in image watermarking, IEEE International Conference on Image Processing, Greece, 1996, pp.237-240.

DOI: 10.1109/icip.1996.560753

Google Scholar