Where to Hide the Bits ?

We present a stochastic two-player zero-sum game between defender and attacker related to the security of practical steganography. The defender wants to hide a message in a cover object drawn by nature. The attacker wants to distinguish plain covers from those with a hidden message. We study the case of n-bit covers, independently but not identically distributed to allow for variation in the predictability between parts of the cover. The defender knows the predictability exactly and chooses k embedding positions. The attacker may obtain side information to predict one chosen position of the cover and compare it to the observed object to make a decision. We present a unique mixed strategy Nash equilibrium for this game. It turns out that the attacker’s strategy is independent of the number of hidden bits k.

[1]  Rainer Bhme.  Advanced Statistical Steganalysis , 2010 .

[2]  Rainer Böhme,et al.  A Game-Theoretic Approach to Content-Adaptive Steganography , 2012, Information Hiding.

[3]  Ying Wang,et al.  Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions , 2007, IEEE Transactions on Information Theory.

[4]  Jessica J. Fridrich,et al.  Minimizing the embedding impact in steganography , 2006, MM&Sec '06.

[5]  Jessica J. Fridrich,et al.  Minimizing embedding impact in steganography using trellis-coded quantization , 2010, Electronic Imaging.

[6]  Pedro M. Domingos,et al.  Adversarial classification , 2004, KDD.

[7]  Moti Yung,et al.  Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.

[8]  John Langford,et al.  Provably Secure Steganography , 2009, IEEE Trans. Computers.

[9]  Jessica J. Fridrich,et al.  Practical methods for minimizing embedding impact in steganography , 2007, Electronic Imaging.

[10]  Rainer Böhme,et al.  Advanced Statistical Steganalysis , 2010, Information Security and Cryptography.

[11]  Tomás Pevný,et al.  The square root law of steganographic capacity , 2008, MM&Sec '08.

[12]  Tomás Pevný,et al.  Using High-Dimensional Image Models to Perform Highly Undetectable Steganography , 2010, Information Hiding.

[13]  Andrew D. Ker.  The Square Root Law in Stegosystems with Imperfect Information , 2010, Information Hiding.

[14]  Stefan Katzenbeisser,et al.  Defining security in steganographic systems , 2002, IS&T/SPIE Electronic Imaging.

[15]  Edward J. Delp,et al.  Media Forensics and Security , 2009 .

[16]  Christian Cachin,et al.  An information-theoretic model for steganography , 1998, Inf. Comput..