Abstract
In this paper, we propose to link practical steganalysis and classical security models. In one hand, some steganography schemes are proved to be secure in some security models but in practice, they cannot be used in real-life because of too many constrains. In the other hand, lots of practical steganography algorithms have been broken by effective steganalysis but without any connection with standard models of attackers. So, we introduce two new types of adversaries to simulate real attackers, the IND-SSA adversary and the IND-USA adversary. The IND-SSA adversary emulates specific steganalysis whereas the IND-USA attacker stands for universal steganalysis. We also define the games and the security models associated with and formalize discrimination attacks and discriminant steganalysis. Then, we connect these new models with the hierarchy of classical security models. Using models introduced by C. Cachin, S. Katzenbeisser and F. Petitcolas, and finally by N. Hopper, we show how effective steganalysis gives us a lower bound on the insecurity of the steganalyzed steganography schemes. We also point out that steganography schemes which are not secure in these new models are also not secure in the classical models of security.
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
Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)
Cachin, C.: An information-theoretic model for steganography. Information and Computation 192(1), 41–56 (2004)
Cachin, C.: Digital steganography. In: van Tilborg, H. (ed.) Encyclopedia of Cryptography and Security. Springer, Heidelberg (2005)
Chandramouli, R.: Mathematical theory for steganalysis. In: Proc. SPIE Security and Watermarking of Multimedia Contents IV (2002)
Chandramouli, R., Kharrazi, M., Memon, N.: Image steganography and steganalysis: Concepts and practice. In: Kalker, T., Cox, I., Ro, Y.M. (eds.) IWDW 2003. LNCS, vol. 2939, pp. 35–49. Springer, Heidelberg (2004)
Chandramouli, R., Memon, N.: Steganography capacity: A steganalysis perspective. In: Proc. SPIE, Security and Watermarking of Multimedia Contents V, Santa Clara, CA, USA, vol. 5020, pp. 173–177 (2003)
Dedić, N., Itkis, G., Reyzin, L., Russel, S.: Upper and lower bounds on black-box steganography. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 227–244. Springer, Heidelberg (2005)
Hopper, N., Langford, J., von Ahn, L.: Provably secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77–92. Springer, Heidelberg (2002)
Katzenbeisser, S., Petitcolas, F.: Defining security in steganographic systems. In: Proc. SPIE Security and Watermarking of Multimedia contents IV, vol. 4675, pp. 50–56 (2002)
von Ahn, L., Hopper, N.J.: Public-key steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 323–341. Springer, Heidelberg (2004)
Levan, T., Kurosawa, K.: Efficient public key steganography secure against adaptative chosen stegotext attacks. In: Proc. Information Hiding, 8th International Workshop, Old Town Alexandria, Virginia, USA (2006)
Hopper, N.: On steganographic chosen covertext security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 311–323. Springer, Heidelberg (2005)
Hopper, N.: Toward a Theory of Steganography. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA (2004)
Ker, A.: The ultimate steganalysis benchmark? In: MM&Sec 2007: Proceedings of the 9th workshop on Multimedia & security, Dallas, Texas, USA, pp. 141–148. ACM, New York (2007)
Westfeld, A., Pfitzmann, A.: Attacks on steganographic systems. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 61–76. Springer, Heidelberg (2000)
Fridrich, J., Goljan, M., Hogea, D.: New methodology for breaking steganographic techniques for JPEGs. In: Proc. SPIE, Security and Watermarking of Multimedia Contents V, Santa Clara, CA, USA, vol. 5020, pp. 143–155 (2003)
Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Science 28, 270–299 (1984)
Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation. In: Proc. 38th Symposium on Foundations of Computer Science FOCS. IEEE, Los Alamitos (1997)
Kerckhoffs, A.: La cryptographie militaire. Journal des Sciences Militaires (1883)
Barbier, J., Filiol, E., Mayoura, K.: Universal detection of JPEG steganography. Journal of Multimedia 2(2), 1–9 (2007)
Barbier, J., Filiol, E., Mayoura, K.: Universal JPEG steganalysis in the compressed frequency domain. In: Shi, Y.Q., Jeon, B. (eds.) IWDW 2006. LNCS, vol. 4283, pp. 253–267. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbier, J., Alt, S. (2008). Practical Insecurity for Effective Steganalysis. In: Solanki, K., Sullivan, K., Madhow, U. (eds) Information Hiding. IH 2008. Lecture Notes in Computer Science, vol 5284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88961-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-88961-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88960-1
Online ISBN: 978-3-540-88961-8
eBook Packages: Computer ScienceComputer Science (R0)