Welcome to the resource topic for 2012/249
Title:
Binary and q-ary Tardos codes, revisited
Authors: Boris Skoric, Jan-Jaap Oosterwijk
Abstract:The Tardos code is a much studied collusion-resistant fingerprinting code, with the special property that it has asymptotically optimal length m\propto c_0^2, where c_0 is the number of colluders. In this paper we give alternative security proofs for the Tardos code, working with the assumption that the strongest coalition strategy is position-independent. We employ the Bernstein inequality and Bennett inequality instead of the typically used Markov inequality. This proof technique requires fewer steps and slightly improves the tightness of the bound on the false negative error probability. We present new results on code length optimization, for both small and asymptotically large coalition sizes.
ePrint: https://eprint.iacr.org/2012/249
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .