Toward Practical Joint Decoding of Binary Tardos Fingerprinting Codes

The class of joint decoder in 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 paper presents an iterative decoder which is the first attempt toward practical large-scale joint decoding. The discriminative feature of the scores benefits on one hand from the side-information of previously found users, and on the other hand, from recently introduced universal linear decoders for compound channels. Neither the code construction nor the decoder makes assumptions about the collusion size and strategy, provided it is a memoryless and fair attack. 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]  Ehsan Amiri,et al.  Fingerprinting codes: higher rates, quick accusations , 2010 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[22]  Koji Nuida,et al.  Short collusion-secure fingerprint codes against three pirates , 2010, International Journal of Information Security.

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

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

[25]  Antonino Simone,et al.  Accusation probabilities in Tardos codes: beyond the Gaussian approximation , 2012, Des. Codes Cryptogr..

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

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

[28]  Koji Nuida.  Short Collusion-Secure Fingerprint Codes against Three Pirates , 2010, Information Hiding.