Asymptotically false-positive-maximizing attack on non-binary Tardos codes

We use a method recently introduced by Simone and Skoric to study accusation probabilities for non-binary Tardos fingerprinting codes. We generalize the pre-computation steps in this approach to include a broad class of collusion attack strategies. We analytically derive properties of a special attack that asymptotically maximizes false accusation probabilities. We present numerical results on sufficient code lengths for this attack, and explain the abrupt transitions that occur in these results.

💡 Research Summary

The paper investigates the worst‑case false‑positive behavior of non‑binary (q‑ary) Tardos fingerprinting codes. Building on the recent analytical framework introduced by Simone and Škorić, the authors extend the pre‑computation stage so that a much broader family of collusion attacks can be handled. The core of the analysis is the parameter (\tilde\mu = \frac{1}{m}\mathbb{E}