Achievable Error Exponents for the Private Fingerprinting Game

Fingerprinting systems in the presence of collusive attacks are analyzed as a game between a fingerprinter and a decoder on the one hand, and a coalition of two or more attackers on the other hand. The fingerprinter distributes, to different users, different fingerprinted copies of a host data (covertext), drawn from a memoryless stationary source, embedded with different fingerprints. The coalition members create a forgery of the data while aiming at erasing the fingerprints in order not to be detected. Their action is modeled by a multiple-access channel (MAC). We analyze the performance of two classes of decoders, associated with different kinds of error events. The decoder of the first class aims at detecting the entire coalition, whereas the second is satisfied with the detection of at least one member of the coalition. Both decoders have access to the original covertext data and observe the forgery in order to identify member(s) of the coalition. Motivated by a worst case approach, we assume that the coalition of attackers is informed of the hiding strategy taken by the fingerprinter and the decoder, while they are uninformed of the attacking scheme. Achievable single-letter expressions for the two kinds of error exponents are obtained. Single-letter lower bounds are also derived for the subclass of constant composition codes. These lower and the upper bounds coincide for the error exponent of the first class. Further, for the error of the first kind, a decoder that is optimal is introduced, and the worst case attack channel is characterized

[1]  N. Wiberg,et al.  Random codes for digital fingerprinting , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[2]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[3]  Deepa Kundur,et al.  Novel approach to collusion-resistant video watermarking , 2002, IS&T/SPIE Electronic Imaging.

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

[5]  Alexander Barg,et al.  Digital fingerprinting codes: problem statements, constructions, identification of traitors , 2003, IEEE Trans. Inf. Theory.

[6]  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.

[7]  Tina Lindkvist,et al.  A class of traceability codes , 2002, IEEE Trans. Inf. Theory.

[8]  Pierre Moulin,et al.  Capacity and Random-Coding Error Exponent for Public Fingerprinting Game , 2006, 2006 IEEE International Symposium on Information Theory.

[9]  Dan.  Collusion-Secure Fingerprinting for Digital Data , 2002 .

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

[11]  Shlomo Shamai,et al.  On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information , 2006, ArXiv.

[12]  Alexander Barg,et al.  On the Fingerprinting Capacity Under the Marking Assumption , 2006, IEEE Transactions on Information Theory.

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

[14]  Jessica Staddon,et al.  Applications of list decoding to tracing traitors , 2003, IEEE Trans. Inf. Theory.

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

[16]  Jacob Lofvenberg.  Codes for Digital Fingerprinting , 2001 .

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

[18]  Syed Ali Jafar.  Capacity With Causal and Noncausal Side Information: A Unified View , 2006, IEEE Transactions on Information Theory.

[19]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[20]  Reihaneh Safavi-Naini,et al.  Collusion Secure q-ary Fingerprinting for Perceptual Content , 2001, Digital Rights Management Workshop.

[21]  Chaoping Xing.  Asymptotic bounds on frameproof codes , 2002, IEEE Trans. Inf. Theory.

[22]  Nadav Shulman,et al.  Communication over an unknown channel via common broadcasting , 2003 .

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

[24]  Shlomo Shamai,et al.  Achievable rates for the broadcast channel with states known at the transmitter , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[25]  Reihaneh Safavi-Naini,et al.  Sequential Traitor Tracing , 2000, CRYPTO.

[26]  Gérard D. Cohen,et al.  Upper bounds on separating codes , 2004, IEEE Transactions on Information Theory.

[27]  Kannan Ramchandran,et al.  Duality between source coding and channel coding and its extension to the side information case , 2003, IEEE Trans. Inf. Theory.

[28]  Gérard D. Cohen,et al.  Copyright protection for digital data , 2000, IEEE Communications Letters.

[29]  Aaron D. Wyner,et al.  Channels with Side Information at the Transmitter , 1993 .

[30]  Robert G. Gallager,et al.  The random coding bound is tight for the average code (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[31]  Alexander Barg,et al.  Good digital fingerprinting codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[32]  J. Nicholas Laneman,et al.  Achievable Rates for Multiple Access Channels with State Information Known at One Encoder , 2004 .

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

[34]  Amos Fiat,et al.  Tracing Traitors , 1994, CRYPTO.

[35]  Neri Merhav,et al.  Correction to "On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks" [Mar 05 884-899] , 2008, IEEE Trans. Inf. Theory.

[36]  Damianos Karakos,et al.  A relationship between quantization and watermarking rates in the presence of additive Gaussian attacks , 2003, IEEE Trans. Inf. Theory.

[37]  Yu-Sun Liu,et al.  A new universal random coding bound for the multiple-access channel , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[38]  Jörg Schwenk,et al.  Combining digital watermarks and collusion-secure fingerprints for digital images , 1999, Electronic Imaging.

[39]  N. Merhav,et al.  On the capacity game of public watermarking systems , 2002, Proceedings IEEE International Symposium on Information Theory,.

[40]  Neri Merhav,et al.  On the capacity game of private fingerprinting systems under collusion attacks , 2003, IEEE Transactions on Information Theory.

[41]  Pierre Moulin,et al.  The parallel-Gaussian watermarking game , 2004, IEEE Transactions on Information Theory.

[42]  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).

[43]  Bernd Girod,et al.  Capacity of digital watermarks subjected to an optimal collusion attack , 2000, 2000 10th European Signal Processing Conference.