Abstract

Forming a logical balance between the quality of the file and the scope of data that can be conveyed is the test of steganographic techniques to form such a balance. On top of that, the facts that cannot be covered up are the robustness of the method and security of the vague data. An insertion method which delivers a high level of visual quality and a huge amount of volume for the obscured data is called the Least Significant Bit (LSB), but the concealed message is poorly secured through this technique. In the recommended approach, the Vigenere encryption techniques initially used to encode the secret data to assure the safety of the concealed message. Later, the data is contracted through the Huffman coding method in order to decrease the occupational volume of the classified data. Then, each bit stream of the data is dispersed out onto the image to enhance the robustness of the technique by using the expanded knight tour algorithm. The outcomes show that apart from enhancing the visual quality of the stego image, the recommended technique enhances the safety and payload capacity issues of the simple LSB technique.

Keywords:

Huffman coding compression, image steganography, knight tour embedding algorithm, LSB insertion technique, vigenere encryption,

References

1. Anand, J.V. and G.D. Dharaneetharan, 2011. New approach in steganography by integrating different LSB algorithms and applying randomization concept to enhance security. Proceedings of the 2011 International Conference on Communication, Computing. Rourkela, Odisha, India, pp: 474-476.
   CrossRef    
2. Anderson, R.J. and F.A.P. Petitcolas, 1998. On the limits of steganography. IEEE J. Sel. Area. Comm., 16: 474-481.
   CrossRef    
3. Aruljothi, S. and M. Venkatesulu, 2010. Symmetric key cryptosystem based on randomized block cipher. Proceedings of the 5th International Conference on Future Information Technology (Future Tech), pp: 1-5.
   CrossRef    
4. Chan, C.K. and L.M. Cheng, 2004. Hiding data in images by simple LSB substitution. Pattern Recogn., 37: 469-474.
   CrossRef    
5. Cheddad, A., J. Condell, K. Curran and P. Mc Kevitt, 2010. Digital image steganography: Survey and analysis of current methods. Signal Process., 90: 727-752.
   CrossRef    
6. Daneshkhah, A., H. Aghaeinia and S.H. Seyedi, 2011. A more secure steganography method in spatial domain. Proceeding of the 2nd International Conference on Intelligent Systems, Modelling and Simulation (ISMS), pp: 189-194.
   CrossRef    
7. Das, R. and T. Tuithung, 2012. A novel steganography method for image based on Huffman encoding. Proceeding of the 3rd National Conference on Emerging Trends and Applications in Computer Science (NCETACS). Shillong, pp: 14-18.
   CrossRef    
8. Dennie, V.T., 2007. Cryptographic techniques for computers: Substitution methods. Inform. Storage Ret., 6: 241-249.
   
9. Dey, S., A. Ajith and A. Sugata, 2007. An LSB data hiding technique using prime numbers. Proceedings of the 3rd International Symposium on Information Assurance and Security (IAS 2007), pp: 101-108.
   CrossRef    
10. Dumitrescu, S., W. Xiaolin and W. Zhe, 2003. Detection of LSB steganography via sample pair analysis. IEEE T. Signal Proces., 51: 355-372.
    
11. Du-Shiau, T., C. Tzung-Her and H. Gwoboa, 2007. A cheating prevention scheme for binary visual cryptography with homogeneous secret images. Pattern Recogn., 40(8): 2356-2366.
    CrossRef    
12. Esra, S. and I. Hakan, 2012. A compression-based text steganography method. J. Syst. Software., 85(10): 2385-2394.
    CrossRef    
13. Jafari, R., D. Ziou and A. Mammeri, 2011. Increasing compression of JPEG images using steganography. Proceeding of the IEEE International Symposium on Robotic and Sensors Environments (ROSE), pp: 226-230.
    CrossRef    
14. Liping, J., L. Xiaolong, Y. Bin and L. Zhihong, 2010. A further study on a PVD-based steganography. Proceeding of the International Conference on Multimedia Information Networking and Security (MINES), pp: 686-690.
    
15. Parberry, I., 1997. An efficient algorithm for the Knight's tour problem. Discrete Appl. Math., 73: 251-260.
    CrossRef    
16. Raja, K.B., C.R. Chowdary, K.R. Venugopal and L.M. Patnaik, 2005. A secure image steganography using LSB, DCT and compression techniques on raw images. Proceedings of the 3rd International Conference on Intelligent Sensing and Information Processing (ICISIP 2005), pp: 170-176.
    CrossRef    
17. Shouchao, S., Z. Jie, L. Xin, D. Jiao and W. Qiaoyan, 2011. A novel secure communication protocol combining steganography and cryptography. Proc. Eng., 15: 2767-2772.
    CrossRef    
18. Sobol, I.M. and Y.L. Levitan, 1999. A pseudo-random number generator for personal computers. Comput. Math. Appl., 37: 33-40.
    CrossRef    
19. Tariq, A.H., A.Q. Mahmoud and B. Hassan, 2003. A testbed for evaluating security and robustness of steganography techniques. Proceeding of the IEEE 46th Midwest Symposium on Circuits and Systems, 3: 1583-1586.
    
20. Wu, H.C., N.I. Wu, C.S. Tsai and M.S. Hwang, 2005. Image steganographic scheme based on pixel-value differencing and LSB replacement methods. Proceedings of the IEE Vision, Image and Signal Processing, 152: 611-615.
    CrossRef    
21. Xiangyang, L., L. Bin and L. Fenlin, 2005. Detecting LSB steganography based on dynamic masks. Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (ISDA '05), pp: 251-255.
    CrossRef    
22. Xinpeng, Z. and W. Shuozhong, 2004. Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced security. Pattern Recogn. Lett., 25(3): 331-339.
    CrossRef    
23. Yi-Zhen, C., H. Zhi, L. Shu-Ping, L. Chun-Hui and Y. Xiao-Hui, 2010. An adaptive steganography algorithm based on block sensitivity vectors using HVS features. Proceedings of the 3rd International Congress on Image and Signal Processing (CISP), 3: 1151-1155.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.