Abstract
We study the application of Hamming codes to wet paper steganography. To that end, we propose the use of decoding algorithms that do not verify the minimum distance property and present one of these algorithms. We study its properties and show results of some numerical experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barg A.: Complexity issues in coding theory. In: Pless V., Huffman W., Brualdi R. (eds.) Handbook of Coding Theory, vol. 1. North-Holland, Amsterdam (1998).
Berlekamp E., McEliece R.J., van Tilborg H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory. 24, 384–386 (1978).
Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. North-Holland, Amsterdam (1997).
Cohen G., Karpovsky M.G., Mattson H.F., Schatz J.: Covering radius. Survey and recent results. IEEE Trans. Inf. Theory. 31, 328–343 (1985).
Cohen G., Munuera C., Solé P.: The average radius of codes: survey and new results. In: Proceedings of ISIT-2011, pp. 1792–1795 (2012).
Crandall R.: Some Notes on Steganography (1998). Posted on the steganography mailing list. http://www.di.unisa.it/~ads/corso-security/www/CORSO-0203/steganografia/LINKS%20LOCALI/matrix-encoding.pdf.
Fontaine C., Galand F.: How Reed–Solomon codes can improve steganographic schemes. EURASIP J. Inf. Secur. 2009, 1–10 (2009).
Fridrich J., Goljan M., Lisonek P., Soukal D.: Writing on wet paper. IEEE Trans. Signal Process. 53, 3923–3935 (2005).
Fridrich J., Goljan M., Soukal D.: Wet paper codes with improved embedding efficiency. IEEE Trans. Inf. Secur. Forensic. 1, 102–110 (2006).
Munuera C.: Steganography from a coding theory point of view. In: Martinez E. (ed.) Algebraic Geometry Modeling in Information Theory, pp. 83–128. Word Scientific, Hackensack (2013).
Munuera C., Barbier M.: Wet paper codes and the dual distance in steganography. Adv. Math. Commun. 6(3), 273–285 (2012).
Mac Williams F.J., Sloane N.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).
Schönfeld D., Winkler A.: Embedding with syndrome coding based on BCH codes. In: Proceedings of the 8th Workshop on Multimedia and Security, MMSec’06, pp. 214–223, New York (2006).
Westfeld A.: F5A Steganographic algorithm. High capacity despite better steganalysis. In: Proceedings of 4th International Workshop on Information Hiding, pp. 289–302. Springer, Heidelberg (2001).
Zhang R., Sachnev V., Kim H.: Fast BCH syndrome coding for steganography. In: Katzenbeisser S., Sadeghi, A.-R. (eds.) Information Hiding. LNCS, vol. 5806, pp. 48–58. Springer, Heidelberg (2009).
Acknowledgments
This work was supported by Spanish Ministry for Science and Technology under Grant MTM2012-36917-C03-02.
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Computer Algebra in Coding Theory and Cryptography”.
Rights and permissions
About this article
Cite this article
Munuera, C. Hamming codes for wet paper steganography. Des. Codes Cryptogr. 76, 101–111 (2015). https://doi.org/10.1007/s10623-014-9998-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-014-9998-5