Abstract
Sometimes the analysis of covert channel is weakly dependent on the correctness of probabilistic models, but more often the result of such analysis is seriously dependent on the choice of a probabilistic model. We show how the problem of detection of covert communications depends on the correctness of the choice of probabilistic model. We found the dependence of judgments about invisibility of covert communication from the bans in a probabilistic model of the legal communication.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johnson, N.F., Duric, Z., Jajodia, S.: Information Hiding: Steganography and Watermarking-Attacks and Countermeasures. Kluwer Academic Publishers, Boston (2000)
Wang, Y., Moulin, P.: Perfectly secure steganography: Capacity, error exponents, and code constructions. IEEE Transactions on Information Theory, Special Issue on Security 54(6) (2008)
Grusho, A., Kniazev, A., Timonina, E.: Detection of Illegal Information Flow. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds.) MMM-ACNS 2005. LNCS, vol. 3685, pp. 235–244. Springer, Heidelberg (2005)
Filler, T., Fridrich, J.: Complete characterization of perfectly secure stego-systems with mutually independent embedding operation. In: Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 19–24 (2009)
Cachin, C.: An information-theoretic model for steganography. Information and Computation 192(1), 41–56 (2004)
Moulin, P., Wang, Y.: New results on steganographic capacity. In: Proceedings of the Conference on Information Sciences and Systems, CISS, March 17-19 (2004)
Filler, T., Fridrich, J., Ker, A.D.: The square root law of steganographic capacity for Markov covers. In: Delp, E.J., Wong, P.W., Memon, N., Dittmann, J. (eds.) Proceedings SPIE, Electronic Imaging, Security and Forensics of Multimedia, San Jose, CA, vol. XI, pp. 18–21 (January 2009)
Simmons, G.J.: The prisoners problem and the subliminal channel. In: Chaum, D. (ed.) Advances in Cryptology: Proceedings of Crypto 1983, pp. 51–67 (1984)
Grusho, A.: On existence of subliminal channels. Discrete Mathematics and Applications 9(2), 1–8 (1999)
Shannon, K.: The works on information theory and cybernetics. Foreign Literature, Moscow (1963) (in Russian)
Bourbaki, N.: Topologie Generale. Science, Moscow (1968) (in Russian)
Prokhorov, U.V., Rozanov, U.A.: Theory of probabilities. Science, Moscow (1993) (in Russian)
Grusho, A., Grebnev, N., Timonina, E.: Covert channel invisibility theorem. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds.) Proceedings of Fourth International Conference on Mathematical Methods, Models, and Architectures for Computer Network Security, MMM-ACNS 2007, pp. 187–196. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grusho, A., Grusho, N., Timonina, E. (2010). Problems of Modeling in the Analysis of Covert Channels. In: Kotenko, I., Skormin, V. (eds) Computer Network Security. MMM-ACNS 2010. Lecture Notes in Computer Science, vol 6258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14706-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14706-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14705-0
Online ISBN: 978-3-642-14706-7
eBook Packages: Computer ScienceComputer Science (R0)