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
On-off keying modulation and tardos fingerprinting
Proceedings of the 10th ACM workshop on Multimedia and security
On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes
Information Hiding
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Saddle-point solution of the fingerprinting capacity game under the marking assumption
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Joint coding and embedding techniques for MultimediaFingerprinting
IEEE Transactions on Information Forensics and Security
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
On the capacity game of private fingerprinting systems under collusion attacks
IEEE Transactions on Information Theory
Tardos Fingerprinting is Better Than We Thought
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We use a method recently introduced by us 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.