On the Saddle-Point Solution and the Large-Coalition Asymptotics of Fingerprinting Games

We study a fingerprinting game in which the number of colluders and the collusion channel are unknown. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace back pirated copies to the colluders. Fingerprinting capacity has recently been derived as the limit value of a sequence of maximin games with mutual information as their payoff functions. However, these games generally do not admit saddle-point solutions and are very hard to solve numerically. Here under the so-called Boneh-Shaw marking assumption, we reformulate the capacity as the value of a single two-person zero-sum game, and show that it is achieved by a saddle-point solution. If the maximal coalition size is k and the fingerprinting alphabet is binary, we show that capacity decays quadratically with k. Furthermore, we prove rigorously that the asymptotic capacity is 1/(k221n2) and we confirm our earlier conjecture that Tardos' choice of the arcsine distribution asymptotically maximizes the mutual information payoff function while the interleaving attack minimizes it. Along with the asymptotics, numerical solutions to the game for small k are also presented.

[1]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[2]  Teddy Furon,et al.  Worst case attacks against binary probabilistic traitor tracing codes , 2009, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS).

[3]  L. Goddard.  Information Theory , 1962, Nature.

[4]  Ehsan Amiri,et al.  Fingerprinting codes: higher rates, quick accusations , 2010 .

[5]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[6]  Neri Merhav,et al.  Achievable Error Exponents for the Private Fingerprinting Game , 2007, IEEE Transactions on Information Theory.

[7]  Pierre Moulin,et al.  Universal fingerprinting: Capacity and random-coding exponents , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Pierre Moulin,et al.  Capacity-achieving fingerprint decoding , 2009, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS).

[9]  Hideki Imai,et al.  Optimization of Tardos's Fingerprinting Codes in a Viewpoint of Memory Amount , 2007, Information Hiding.

[10]  François Bavaud,et al.  Information Theory, Relative Entropy and Statistics , 2009, Formal Theories of Information.

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

[12]  Stefan Katzenbeisser,et al.  Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes , 2008, Des. Codes Cryptogr..

[13]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

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

[15]  Gábor Tardos,et al.  High rate fingerprinting codes and the fingerprinting capacity , 2009, SODA.

[16]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

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

[18]  Pierre Moulin,et al.  Saddle-point solution of the fingerprinting capacity game under the marking assumption , 2009, 2009 IEEE International Symposium on Information Theory.

[19]  Teddy Furon,et al.  On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes , 2008, Information Hiding.

[20]  N. Merhav,et al.  On the capacity game of private fingerprinting systems under collusion attacks , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[21]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[22]  Ilya Dumer,et al.  Equal-Weight Fingerprinting Codes , 2009, IWCC.

[23]  M. Sion.  On general minimax theorems , 1958 .

[24]  Tamir Tassa,et al.  Improved versions of Tardos’ fingerprinting scheme , 2008, Des. Codes Cryptogr..

[25]  Boris Skoric,et al.  Tardos Fingerprinting is Better Than We Thought , 2006, IEEE Transactions on Information Theory.

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

[27]  Mircea D. Farcas,et al.  About Bernstein polynomials , 2008 .

[28]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[29]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .