False positive probabilities in q-ary Tardos codes : comparison of attacks

We investigate false positive (FP) accusation probabilities for q -ary Tardos codes in the Restricted Digit Model. We employ a computation method recently introduced by us, to which we refer as Convolution and Series Expansion (CSE). We present a comparison of several collusion attacks on q -ary codes: majority voting, minority voting, Interleaving, µ~ -minimizing and Random Symbol (the q -ary equivalent of the Coin Flip strategy). The comparison is made by looking at the FP rate at approximately fixed False Negative rate. In nearly all cases we find that the strongest attack is either minority voting or µ~ -minimizing, depending on the exact setting of parameters such as alphabet size, code length, and coalition size. Furthermore, we present results on the convergence speed of the CSE method, and we show how FP rate computations for the Random Symbol strategy can be sped up by a pre-computation step. Keywords: Traitor tracing; Tardos code; Collusion; Watermarkin