Towards joint decoding of binary Tardos fingerprinting codes

The class of joint decoder of probabilistic fingerprinting codes is of utmost importance in theoretical papers to establish the concept of fingerprint capacity. However, no implementation supporting a large user base is known to date. This article presents an iterative decoder which is, as far as we are aware of, the first practical attempt towards joint decoding. The discriminative feature of the scores benefits on one hand from the side-information of previously accused users, and on the other hand, from recently introduced universal linear decoders for compound channels. Neither the code construction nor the decoder make precise assumptions about the collusion (size or strategy). The extension to incorporate soft outputs from the watermarking layer is straightforward. An extensive experimental work benchmarks the very good performance and offers a clear comparison with previous state-of-the-art decoders.

[1]  Pierre Moulin,et al.  A high-rate fingerprinting code , 2008, Electronic Imaging.

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

[3]  Lizhong Zheng,et al.  Linear Universal Decoding for Compound Channels , 2010, IEEE Transactions on Information Theory.

[4]  N. Hengartner,et al.  Simulation and Estimation of Extreme Quantiles and Extreme Probabilities , 2011 .

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

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

[7]  Miguel Soriano,et al.  Identification of traitors in algebraic-geometric traceability codes , 2004, IEEE Transactions on Signal Processing.

[8]  Pierre Moulin,et al.  On the Saddle-Point Solution and the Large-Coalition Asymptotics of Fingerprinting Games , 2010, IEEE Transactions on Information Forensics and Security.

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

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

[11]  Teddy Furon,et al.  Blind decoder for binary probabilistic traitor tracing codes , 2009, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS).

[12]  Teddy Furon,et al.  Iterative single tardos decoder with controlled probability of false positive , 2011, 2011 IEEE International Conference on Multimedia and Expo.

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

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

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

[16]  Pierre Moulin,et al.  On the Saddle-point Solution and the Large-Coalition Behavior of Fingerprinting Games , 2010, ArXiv.

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

[18]  Minoru Kuribayashi,et al.  Experimental Assessment of Probabilistic Fingerprinting Codes over AWGN Channel , 2010, IWSEC.

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

[20]  Teddy Furon,et al.  Towards Joint Tardos Decoding: The 'Don Quixote' Algorithm , 2011, Information Hiding.

[21]  Teddy Furon,et al.  EM decoding of tardos traitor tracing codes , 2009, MM&Sec '09.

[22]  Hans Georg Schaathun,et al.  On error-correcting fingerprinting codes for use with watermarking , 2008, Multimedia Systems.

[23]  Pierre Moulin,et al.  High-Rate Random-Like Spherical Fingerprinting Codes With Linear Decoding Complexity , 2009, IEEE Transactions on Information Forensics and Security.

[24]  Stefan Katzenbeisser,et al.  Tardos fingerprinting codes in the combined digit model , 2009, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS).

[25]  Hideki Imai,et al.  An improvement of discrete Tardos fingerprinting codes , 2009, Des. Codes Cryptogr..