Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
Improved versions of Tardos' fingerprinting scheme
Designs, Codes and Cryptography
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
Optimization of Tardos's fingerprinting codes in a viewpoint of memory amount
IH'07 Proceedings of the 9th international conference on Information hiding
On the Saddle-Point Solution and the Large-Coalition Asymptotics of Fingerprinting Games
IEEE Transactions on Information Forensics and Security - Part 2
| Hi-index | 0.00 |
The Tardos scheme is a well-known traitor tracing scheme to protect copyrighted content against collusion attacks. The original scheme contained some suboptimal design choices, such as the score function and the distribution function used for generating the biases. Skoric et al. previously showed that a symbol-symmetric score function leads to shorter codes, while Nuida et al. obtained the optimal distribution functions for arbitrary coalition sizes. Later, Nuida et al. showed that combining these results leads to even shorter codes when the coalition size is small. We extend their analysis to the case of large coalitions and prove that these optimal distributions converge to the arcsine distribution, thus showing that the arcsine distribution is asymptotically optimal in the symmetric Tardos scheme. We also present a new, practical alternative to the discrete distributions of Nuida et al. and give a comparison of the estimated lengths of the fingerprinting codes for each of these distributions.