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.
Keywordstraitor tracing fingerprinting transactional watermarking joint decoder
Unable to display preview. Download preview PDF.
- 3.Cérou, F., Furon, T., Guyader, A.: Experimental assessment of the reliability for watermarking and fingerprinting schemes. EURASIP Jounal on Information Security (2008), iD 414962, 12 pagesGoogle Scholar
- 4.Furon, T., Pérez-Freire, L.: Worst case attacks against binary probabilistic traitor tracing codes. In: Proc. First IEEE Int. Workshop on Information Forensics and Security, London, UK, pp. 46–50 (December 2009)Google Scholar
- 5.Knuth, D.E.: The Art of Computer Programming, Generating All Combinations and Partitions, vol. 4. Addison-Wesley, Reading (2005); Fascicle 3Google Scholar
- 6.Moulin, P.: Universal fingerprinting: Capacity and random-coding exponents. In: Proc. IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, pp. 220–224 (July 2008)Google Scholar
- 10.Pérez-Freire, L., Furon, T.: Blind decoder for binary probabilistic traitor tracing codes. In: Proc. First IEEE Int. Workshop on Information Forensics and Security, London, UK, pp. 56–60 (December 2009)Google Scholar
- 11.Saito, M., Matsumoto, M.: A PRNG specialized in double precision floating point numbers using an affine transition. In: Proc. Eighth Int. Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, MCQMC 2008, pp. 589–602. Springer, Montréal (2008)Google Scholar
- 13.Tardos, G.: Optimal probabilistic fingerprint codes. In: Proc. 35th ACM Symposium on Theory of Computing, San Diego, CA, USA, pp. 116–125 (2003), http://www.renyi.hu/~tardos/publications.html