An Efficient Secret Image Sharing Scheme

Article Preview

Abstract:

This paper refers to a novel (r, n)-threshold secret image sharing scheme with low information overhead. The secret image is encoded into n noise-like shadow images in such a way that any r of the n shares can be used to reveal the secret, and no information about the secret can be revealed from any r–1 or fewer shares. The size of the shadow images is relatively small. Compared with the commonly used in the field of secret image sharing “Thien-Lin algorithm (2002),” the proposed scheme provides an alternative solution for light images. For the security analysis in the case of a 256x256 gray level secret image, if a hacker acquires any r – 1 shadow images, the hacker can construct only r – 1 equations, then the possibility of guessing the right solution is only 1/256. Hence, there are (256x256)/r polynomials, the possibility of obtaining the right image is only (1/256) (256x256)/r. The experimental results and theoretically analysis demonstrate that the proposed scheme performs well.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3025-3029

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] C.C. Thien and J.C. Lin, "Secret image sharing," Computers and Graphics, Vol. 26, No. 5, pp.765-770, (2002).

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

Google Scholar

[2] G.R. Blakley, "Safeguarding cryptographic keys," AFIPS Conference Proceedings, Vol. 48, pp.313-317, (1979).

Google Scholar

[3] A. Shamir, "How to share a secret," Communications of the ACM, Vol. 22, No. 11, pp.612-613, (1979).

DOI: 10.1145/359168.359176

Google Scholar

[4] C.C. Lin and W.H. Tsai, "Secret image sharing with capability of share data reduction," Optical Engineering, Vol. 42, pp.2340-2345, (2005).

DOI: 10.1117/1.1588661

Google Scholar

[5] R.Z. Wang and C.H. Su, "Secret image sharing with smaller shadow images," Pattern Recognition Letters, Vol. 27, No. 6, pp.551-555, (2006).

DOI: 10.1016/j.patrec.2005.09.021

Google Scholar

[6] C.C. Chang, C.C. Lin and Y.H. Chen, "A novel secret image sharing scheme in color images using small shadow images," Information Sciences, Vol. 178, pp.2433-2447, (2008).

DOI: 10.1016/j.ins.2007.12.016

Google Scholar

[7] C.C. Lin and W.H. Tsai, "Secret image sharing with steganography and authentication," Journal of Systems and Software, Vol. 73, No. 3, pp.405-414, (2004).

DOI: 10.1016/s0164-1212(03)00239-5

Google Scholar

[8] C.C. Thein and J.C. Lin, "An image sharing method with user-friendly shadow images," IEEE Transactions on Circuits and Systems for Video Technology, Vol. 13, No. 12 pp.1161-1169, (2003).

DOI: 10.1109/tcsvt.2003.819176

Google Scholar

[9] S.K. Chen and J.C. Lin, "Fault-Tolerant and Progressive Transmission of images," Pattern Recognition, Vol. 38, No. 12, pp.2466-2471, (2005).

DOI: 10.1016/j.patcog.2005.04.002

Google Scholar

[10] L. Bai, "A Reliable (k,n) Image Secret Sharing Scheme with Low Information Overhead," International Journal of Computers and Applications, Vol. 32, No. 1, pp.9-14, (2010).

DOI: 10.1080/1206212x.2010.11441955

Google Scholar

[11] R.Z. Wang, Y.C. Lan, Y.K. Lee, S.Y. Huang, S.J. Shyu, T.L. Chia, "Incrementing visual cryptography using random grids," Optics Communications, Vol. 283, pp.4242-4249, (2010).

DOI: 10.1016/j.optcom.2010.06.042

Google Scholar