Abstract
We consider a scenario where information hiding (IH) is performed through noisy channels. There may arise different situations but one of the most common is the case where the legal IH channel is superior to the attacker IH channel. If a special randomized encoding is used by legal users then it is possible to hide information in the noisy components of the cover message. At the same time, the randomized encoding prevents the secret message to be removed from the stegomessage without any significant distortion of the cover message. If a legal decoder of IH knows the cover message, a randomized encoding procedure does not prevent the error correction of the secret message at the receiving side. The special problem of IH - how to distinguish any binary periodic repetitive sequence from truly random binary noise received on noisy channels - is presented. Application of the randomized encoding technique makes a solution to this problem more difficult and hence complicates a traffic analysis. We consider also how is it possible to “camouflage” IH by natural channel noises independently of the properties of the cover messages probability space, and the application of WM in combination with randomized encoding dedicated to the utilization of noisy channels. If an attacker tries to remove WM by adding binary noise then an expansion of errors in the cover message results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bennet, C. H., Brassard, G., Maurer, U. M.: “Generalized privacy amplifications”. IEEE Trans. on IT, vol. 41, nr. 6, pp. 1915–1923. 1995.
Brassil, J., O’Gorman, L.: “Watermarking document images with Bounding Box Expansion”. First International Workshop, IH’96, Lecture Notes in Computer Science, vol. 1174, pp. 227–235. Springer-Verlag. 1996.
Cachin, C.: “An information-theoretic model for steganography”. Second International Workshop, IH’98, Lecture Notes in Computer Science, vol. 1525, pp. 306–318. Springer-Verlag. 1998.
Cohen, A., Lapidoth, A.: “On the Gaussian watermarking game”. Proc. of the 2000 IEEE International Symposium on Information Theory, p. 48. 2000.
Craver, S.: “On public-key steganography in the presence of an active warden”. Second International Workshop, IH’98, Lecture Notes in Computer Science, vol. 1525, pp. 356–368. Springer-Verlag. 1998.
Gruhl, D., Lu, A., Bender, W.: “Echo hiding”. First International Workshop, IH’96, Lecture Notes in Computer Science, vol. 1174, pp. 295–315. Springer-Verlag. 1996.
Korjik, V., Yakovlev, V.: “Non-asymptotic estimates of information protection efficiency for the wire-trap channel concept”. Auscrypt’92, Lecture Notes in Computer Science, vol. 718, pp. 185–195. Springer-Verlag. 1993.
Moulin, P., O’Sullivan, J. A.: “Information-theoretic analysis of information hiding”. Proc. of the IEEE International Symposium on Information Theory, Boston. 1998.
Wyner, A.: “The wire-tap channel”. Bell Syst. Tech. Journal, 1975, pp. 1355–1381.
Zöllner, J., Federrath, H., Klimant, A., Pfitzmann, A., Piotraschke, R., Westfeld, A., Wicke, G., Wolf, G.: “Modeling the security of steganographic systems”. Second International Workshop, IH’98, Lecture Notes in Computer Science, vol. 1525, pp. 344–354. Springer-Verlag. 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korjik, V., Morales-Luna, G. (2001). Information Hiding through Noisy Channels. In: Moskowitz, I.S. (eds) Information Hiding. IH 2001. Lecture Notes in Computer Science, vol 2137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45496-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-45496-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42733-9
Online ISBN: 978-3-540-45496-0
eBook Packages: Springer Book Archive