Abstract
In this paper, we show the role of modules over rings of finite characteristics in data hiding area. Applications of correcting codes and covering functions in data hiding are shown as special cases of our module approach. Applications of modules over rings of characteristic 2 to design new embedding schemes for hiding secret data in binary images are introduced.
This work is partially supported by Vietnamese National Foundation for Science & Technology Development (NAFOSTED).
Chapter PDF
References
Bierbrauer, J.: Crandall’s problem (1998) (unpublished), http://www.ws.binghamton.edu/fridrich/covcodes.pdf
Chang, C.C., Kieu, T.D., Chou, Y.C.: A High Payload Steganographic Scheme based on (7,4) Hamming Code for Digital Images. In: Electronic Commerce and Security 2008 Symposium, pp. 16–21 (2008)
Chen, Y., Pan, H., Tseng, Y.: A secure of data hiding scheme for two-color images. In: IEEE Symposium on Computers and Communications (2000)
Kim, C., Shin, D., Shin, D.: Data Hiding in a Halftone Image Using Hamming Code (15, 11). In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011, Part II. LNCS, vol. 6592, pp. 372–381. Springer, Heidelberg (2011)
Crandall, R.: Some notes on steganography. Posted on steganography mailing list (1998), http://os.inf.tu-dresden.de/_westfeld/crandall.pdf
Galand, Kabatiansky, G.: Information hiding by coverings. In: Proceedings of the IEEE Information Theory Workshop, pp. 151–154 (2004)
Bierbrauer, J., Fridrich, J.: Constructing Good Covering Codes for Applications in Steganography. In: Shi, Y.Q. (ed.) Transactions on DHMS III. LNCS, vol. 4920, pp. 1–22. Springer, Heidelberg (2008)
Lee, C.F., Chen, H.L.: A novel data hiding scheme based on modulus function. The Journal of Systems and Software 83, 832–843 (2010)
Ould Medeni, M.B., Souidi, E.M.: A Novel Steganographic Protocol from Error-correcting Codes. Journal of Information Hiding and Multimedia Signal Processing 1(4) (October 2010) ISSN 2073-4212
Nordstrom, A.W., Robinson, J.P.: An optimum nonlinear code. Information and Control 11, 613–616 (1967)
Phan, T.H., Nguyen, H.T.: On the Maximality of Secret Data Ratio in CPTE Schemes. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011, Part I. LNCS (LNAI), vol. 6591, pp. 88–99. Springer, Heidelberg (2011)
Preparata, F.P.: A class of optimum nonlinear double-error-correcting codes. Information and Control 13, 378–400 (1968)
Struik, R.: Covering Codes. Ph.D. dissertation, Eindhoven (1994)
Zhang, W., Zhang, X., Wang, S.: Maximizing Steganographic Embedding Efficiency by Combining Hamming Codes and Wet Paper Codes. In: Solanki, K., Sullivan, K., Madhow, U. (eds.) IH 2008. LNCS, vol. 5284, pp. 60–71. Springer, Heidelberg (2008)
Westfeld, A.: F5–A Steganographic Algorithm High Capacity Despite Better Steganalysis. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol. 2137, pp. 289–302. Springer, Heidelberg (2001)
Wu, M.Y., Lee, J.H.: Anovel data embedding method for two-color fascimile images. In: Proceedings of International Symposium on Multimedia Information Processing. Chung-Li, Taiwan, R.O.C (1998)
Zhang, X., Wang, S.: Analysis of Parity Assignment Steganography in Palette Images. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3683, pp. 1025–1031. Springer, Heidelberg (2005)
Zhang, X., Wang, S.: Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced security. Pattern Recognition Letters 25, 331–339 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Huy, P.T., Thanh, N.H., Kim, C. (2012). Relationship between Correcting Code and Module Technique in Hiding Secret Data. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-35606-3_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35605-6
Online ISBN: 978-3-642-35606-3
eBook Packages: Computer ScienceComputer Science (R0)