Moderate Bit Insertion for Hiding Crypto Data in Digital Image for Steganography

Print
IP Multimedia Communications
© 2011 by IJCA Journal
ISBN : 978-93-80864-99-3
Year of Publication: 2011
Authors:
Balkrishan
Amar Partap Singh

Balkrishan and Amar Partap Singh. Moderate Bit Insertion for Hiding Crypto Data in Digital Image for Steganography. Special issues on IP Multimedia Communications (1):136-138, October 2011. Full text available. BibTeX

@article{key:article,
	author = {Balkrishan and Amar Partap Singh},
	title = {Moderate Bit Insertion for Hiding Crypto Data in Digital Image for Steganography},
	journal = {Special issues on IP Multimedia Communications},
	month = {October},
	year = {2011},
	number = {1},
	pages = {136-138},
	note = {Full text available}
}

Abstract

The simplest method least-significant-bit (LSB) substitution embeds the important data in the least significant bits and introduces small distortion into the pixels of cover image. Many data hiding techniques mainly focused to reduce the distortion of cover image when sensitive data is embedded into the cover image. It also prevents the visual quality degradation of cover image. However, the post processing of stego image or stego image occur transmitting errors. The receiver cannot extract the correct information from the stego-image having any such type of errors. To overcome these problems, a novel method for crypto data hiding within grey scale image in the spatial domain is proposed, so that the interceptors will not notice about the existence of the important data. The basic concept of the proposed method is to embed the important crypto data in the 4th moderately-significant-bit of pixel of an image. The first 3 LSB bits of image pixel is used for local pixel adjustment to reduce the effect of degradation in the cover image due to moderate bit insertion. Experimental results are performed on four different same size images and shows that the visual quality of the stego image is acceptable. This method provides a higher security and more robust to attacks such as compression, cropping and some other image processing methods than the LSB of stego-image.

Reference

  1. R. Z. Wang, C. F. Lin, and J. C. Lin, “Image hiding by optimal LSB substitution and genetic algorithm,” Pattern Recognition, vol. 34, no. 3, pp. 671–683, 2001.
  2. Y.H. Chu, S. Chang, “Dynamical cryptography based on synchronized chaotic systems,” Electronic Letters,vol. 35 (12), pp. 974–975, 1999.
  3. H. J. Highland, “Data encryption: a non-mathematical approach,” Computer Security 16, pp. 369–386, 1997.
  4. C. C. Chang, J. Y. Hsiao, and C. S. Chan,“Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy,” Pattern Recognition,vol. 36, no. 7, pp. 1583–1595, 2003.
  5. R. Z. Wang, C. F. Lin, and J. C. Lin,“Hiding data in images by optimal moderately-significant-bit replacement,” Electronics Letters, vol. 36, no.25, pp. 2069-2070, 2000.
  6. Balkrishan and Amar Partap Singh, “Secure Data Communication using Moderate Bit Substitution for Data Hiding with Three Layer Security,” IE(I) Journal-ET, vol. 91, pp. 45-50,july 2010.
  7. F. A. P. Petitcolas, R. J. Anderson and M.G. Kuhn, “Information Hiding–A Survey,” Proceedings of IEEE, vol. 87, pp. 1062-1078, July 1999.
  8. D.W. Bender, N.M. Gruhl, A. Lu,Techniques for data hiding, IBM Systems J. 35,pp. 313–336, 1996.
  9. Balkrishan and Amar Partap Singh, “Hiding Encrypted Data using Randomly Chosen Moderate Bit Insertion in Digital Image Steganography,” Journal of Computer Science and Engineering, vol. 1, issue 2, pp. 21-27, June 2010.
  10. Rafael C. Gonzalez, Richard E. Woods,"Digital Image Processing,” Pearson Education, 2003.