Analysis of Message hiding algorithm in Image Steganography and Designing an Efficient Algorithm

Author

Abstract

Security, robustness, and capacity are the most important evaluation criteria in steganography. The aim of robustness in image steganography is the stability of embedded message against removal and distortion due to intentional and unintentional attacks such as noise and filtering. Methods of message hiding based on LSB, which are the basis of many steganography algorithms, are vulnerable to such attacks. In this paper, with the two-fold improvement of the well-known hiding algorithm, , the first is to hide two bits of the message in LSB2 of three pixels, the resistor is improved and the latter by hiding the three bits of the message in LSB2 of four pixels, the resistor and the capacity are improved simultaneously.

Keywords

References

[1] Cox, I., Miller, M., Bloom, J., Fridrich, J., and Kalker, T., “Digital watermarking and steganography,” 2nd Ed., Morgan Kaufmann, Burlington, 2007.
[2] Petitcolas, F. A. P., Anderson, R. J., and Kuhn, M. G., “Information hiding: A survey,” Proc. of the IEEE, Vol. 87, No. 7, July, 1999, pp. 1062–1078.
[3] Bohem, R., “Advanced statistical steganalysis,” Springer-Verlag Berlin Heidelberg, 2011.
[4] Wu, D. C., and Tsai, W. H, “A steganographic method for images by pixel value differencing,” Pattern Recognition Letters 24, 2003, pp. 1613–1626.
[5] Zhang, X., and Wang, S., “Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced security,” Pattern Recogn. Lett., Vol. 25, No. 3, 2004, pp. 331–339.
[6] Yang, C. H., Weng, C. Y., Wang, S. J., and Sun, H. M., “Adaptive data hiding in edge areas of images with spatial LSB domain systems,” IEEE Trans. Inf. Forensics Security, Vol. 3, No. 3, 2008, pp. 488–497.
[7] Kumar, V., and Muttoo, S. K., “A graph theoretic approach to digital steganography,” MIS Review, Vol. 17, No. 1, Sep. 2011, pp. 19-37.
[8] Hetzl, S. and Mutzel, P., “A graph-theoretic approach to steganography,” Proceedings of the 9th IFIP TC-6 TC-11 International Conference: Communications and Multimedia Security, Salzburg, Austria, Sep. 19-21, 2005, pp. 119-128.
[9] Gross, J. L., and Yellen, J., “Handbook of graph theory, ser. discrete mathematics and its applications,” CRC Press, Vol. 25, 2003.
[10] Crandall, R., “Some notes on steganography,” Posted on Steganography, http://os.inf.tu-dresden. de/˜westfeld/Crandall, pdf, 1998.
[11] Westf, A., eld, “High capacity despite better steganalysis (F5–A steganographic algorithm),” In: Moskowitz, I. S. (eds.): Information Hiding. 4 the International Workshop. Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg New York, Vol. 2137, 2001, pp. 289– 302.
[12] Al-Dmour, H., and Al-Ani, A., “A steganography embedding method based on edge identification and XOR coding,” Elsevier, Sience direct, Vol. 46, 2016., pp. 293-306.
[13] Mielikainen, J., “LSB matching revisited,” IEEE Signal Processing Letters, Vol. 13, No. 5, 2006, pp. 285-287.
[14] Luo, W., Huang, F., and Huang, J., “Edge adaptive image steganography based on LSB matching revisited,” IEEE Trans. Inf. Forensics Security, Vol. 5, No. 2, 2010, pp. 201–214.
[15] Mustafa, A. E., Elgamal, A. M. F., ElAlmi, M. E., and Ahmed, B. D., “A proposed algorithm for steganography in digital Image based on least significant bit,” Research Journal Specific Education Faculty of Specific Education, Mansoura University, No. 21, 2011, pp. 752-767.
[16] Shamalizade, M. A., Noroozi, Z. and Karami, M. R., “A new algorithm for embedding message in image steganography,” International Journal of Engineering Research and Technology, Vol. 3, No. 2, ISSN 2278–0181, Feb. 2014.

Files

Share

How to cite

Statistics