Data Hiding using Graphical Code based Steganography Technique

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
© 2015 by IJETT Journal
Volume-27 Number-3
Year of Publication : 2015
Authors : Debajit Sensarma, Samar Sen Sarma
DOI :  10.14445/22315381/IJETT-V27P225


Debajit Sensarma, Samar Sen Sarma"Data Hiding using Graphical Code based Steganography Technique", International Journal of Engineering Trends and Technology (IJETT), V27(3),143-147 September 2015. ISSN:2231-5381. published by seventh sense research group

Data hiding has received much attention due to rapid development of internet and multimedia technologies where security of information is a very important concern. This is achieved by Steganography, which is the art or science of hiding data into another data, so that human eyes cannot catch the hidden information easily. There are many ways to hide information-like inside an image, text, audio/ video etc. Among them image steganography is a very attractive research area. The goal is to transmit a data within a modified image (called stego-image) by minimizing the number of bit flips. In this paper, a new steganography technique has been proposed using Graphical codes and also comparison with steganography technique using BCH codes has been studied.


[1] F. Y. Shih, Digital watermarking and steganography: fundamentals and techniques. CRC Press, 2007.
[2] S. Gandharba, and S. K. Lenka. “Classification image steganography techniques in spatial domain: A study.” Int J Comput Sci Eng Tech 5.3 (2014): 219-32.
[3] Al-Ani, Zaidoon Kh, A. A. Zaidan, B. B. Zaidan, and Hamdan Alanazi. “Overview: Main fundamentals for steganography.” arXiv preprint arXiv:1003.4086 (2010).
[4] C. E. Shannon, “A mathematical theory of communication.” ACM SIGMOBILE Mobile Computing and Communications Review 5.1 (2001): 3-55.
[5] R. W. Hamming, “Error detecting and error correcting codes.” Bell System technical journal 29.2 (1950): 147-160. [6] D. Costello, and L. Shu, “Error control coding.” New Jersey (2004).
[7] J. G. Michaels, and K. H. Rosen. Applications of discrete mathematics. McGraw-Hill Higher Education, 1991.
[8] N. Deo. Graph theory with applications to engineering and computer science. PHI Learning Pvt. Ltd., 2004.
[9] S. L. Hakimi, and J. G. Bredeson. “Graph theoretic errorcorrecting codes.” IEEE Transactions on Information Theory 14.4 (1968): 584-591.
[10] S. Hakimi, and H. Frank. “Cut-set matrices and linear codes (Corresp.).” Information Theory, IEEE Transactions on 11.3 (1965): 457-458.
[11] J. Bredeson, and S. Hakimi. “Decoding of graph theoretic codes (Corresp.).” IEEE Transactions on Information Theory 13.2 (1967): 348-349.
[12] D. Jungnickel. Graphs, networks and algorithms. Heidelberg: Springer, 2008.
[13] D. Jungnickel, and S. Vanstone. “Graphical codes revisited.” Information Theory, IEEE Transactions on 43.1 (1997): 136- 146.
[14] P. Solé, and T. Zaslavsky. “The covering radius of the cycle code of a graph.” Discrete applied mathematics 45.1 (1993): 63-70.
[15] H. Rifà-Pous, and J. Rifà. “Product perfect codes and steganography.” Digital Signal Processing 19.4 (2009): 764- 769.
[16] M. O. Medeni, and E. M. Souidi. “A novel steganographic protocol from error-correcting codes.” Journal of Information Hiding and Multimedia Signal Processing 1.4 (2010): 337- 343.
[17] A. Westfeld. “F5—a steganographic algorithm.” Information hiding. Springer Berlin Heidelberg, 2001.
[18] R. Crandall. “Some notes on steganography.” Posted on steganography mailing list (1998).
[19] I. Diop, S. M. Farssi, O. Khouma, H. B. Diouf, K. Tall, and K. Sylla. “New Steganographic scheme based of Reed- Solomon codes.” International Journal of Distributed and Parallel Systems (IJDPS), Vol 3 (2012).
[20] C. Fontaine and Fabien Galand. “How Reed-Solomon codes can improve steganographic schemes.” EURASIP Journal on Information Security 2009 (2009): 1.
[21] J. Fridrich, M. Goljan, and D. Soukal. “Wet paper codes with improved embedding efficiency.” Electronic Imaging 2006. International Society for Optics and Photonics, 2006.
[22] S. Kumar, and S. K. Muttoo. “Robust and secure image steganographic algorithm based on matrix embedding.” International Journal of Electronic Security and Digital Forensics 6.3 (2014): 219-240.
[23] C. Munuera. “Hamming codes for wet paper steganography.” Designs, Codes and Cryptography 76.1 (2015): 101-111.
[24] C. Kim, and C. N. Yang. “Steganography Based on Grayscale Images Using (5, 3) Hamming Code.” Digital- Forensics and Watermarking. Springer International Publishing, 2014. 588-598.
[25] I. Diop, S. M. Farss, K. Tall, P. A. Fall, M. L. Diouf, and A. K. Diop. “Adaptive Steganography scheme based on LDPC codes.” In Advanced Communication Technology (ICACT), 2014 16th International Conference on, pp. 162-166. IEEE, 2014.
[26] U. Madhow. Introduction to Communication Systems. Cambridge University Press, 2014.
[27] D. Sensarma, and S. Sen Sarma, “A Unified Framework for Security and Storage of Information A Unified Framework for Security and Storage of Information”, International Journal of Advance Engineering and Research Development, Vol.2, No. 1, 2015.

Steganography, data hiding, graphical codes, covering radius, embedding efficiency.