Towards Joint Tardos Decoding: The 'Don Quixote' Algorithm

'Don Quixote' is a new accusation process for Tardos traitor tracing codes which is, as far as we know, the first practical implementation of joint decoding. The first key idea is to iteratively prune the list of potential colluders to keep the computational effort tractable while going from single, to pair,... to t-subset joint decoding. At the same time, we include users accused in previous iterations as side-information to build a more discriminative test. The second idea, coming from the field of mismatched decoders and compound channels, is to use a linear decoder based on the worst case perceived collusion channel. The decoder is tested under two accusation policies: to catch one colluder, or to catch as many colluders as possible. The probability of false positive is controlled thanks to a rare event estimator. We describe a fast implementation supporting millions of users and compare our results with two recent fingerprinting codes.

[1]  Teddy Furon,et al.  Experimental Assessment of the Reliability for Watermarking and Fingerprinting Schemes , 2008, EURASIP J. Inf. Secur..

[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]  Min Wu,et al.  Collusion-resistant fingerprinting for multimedia , 2004 .

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

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

[6]  Gábor Tardos,et al.  Optimal probabilistic fingerprint codes , 2003, STOC '03.

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

[8]  David Thomas,et al.  The Art in Computer Programming , 2001 .

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

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

[11]  W. H. Payne,et al.  Combination Generators , 1979, TOMS.

[12]  Mutsuo Saito,et al.  A PRNG Specialized in Double Precision Floating Point Numbers Using an Affine Transition , 2009 .

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

[14]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

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