On the capacity game of public watermarking systems

Watermarking codes are analyzed as a game between two players: an information hider and a decoder, on the one hand, and an attacker on the other hand. It is assumed that the covertext (the original data within which the message is hidden) is drawn from a memoryless stationary source and its realization is available at the information hider only. The information hider is allowed to cause some tolerable level of distortion to the covertext, and the resulting distorted data can suffer some additional amount of distortion caused by an attacker who aims at erasing the message. Motivated by a worst case approach, we assume that the attacker is informed of the hiding strategy taken by the information hider and the decoder, while they are uninformed of the attacking scheme. The capacity is expressed as the limit of a sequence of single-letter expressions under the assumption that the encoder uses constant composition codes.

[1]  Ingemar J. Cox,et al.  Watermarking as communications with side information , 1999, Proc. IEEE.

[2]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[3]  Amos Lapidoth,et al.  The capacity of the vector Gaussian watermarking game , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[4]  Neri Merhav.  On random coding error exponents of watermarking systems , 2000, IEEE Trans. Inf. Theory.

[5]  J.A. O'Sullivan,et al.  Information theoretic analysis of steganography , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[6]  Neri Merhav,et al.  On the error exponent and capacity games of private watermarking systems , 2003, IEEE Trans. Inf. Theory.

[7]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of information hiding , 2003, IEEE Trans. Inf. Theory.

[8]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[9]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[10]  Samuel Karlin,et al.  Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[11]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[12]  Toby Berger,et al.  Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.

[13]  Ross J. Anderson.  Stretching the Limits of Steganography , 1996, Information Hiding.

[14]  Neri Merhav,et al.  Identification in the presence of side information with application to watermarking , 2001, IEEE Trans. Inf. Theory.