Collusion Secure q-ary Fingerprinting for Perceptual Content
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
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
Combining Tardos fingerprinting codes and fingercasting
IH'07 Proceedings of the 9th international conference on Information hiding
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors
IEEE Transactions on Information Theory
Experimental assessment of probabilistic fingerprinting codes over AWGN channel
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Tardos's fingerprinting code over AWGN channel
IH'10 Proceedings of the 12th international conference on Information hiding
Asymptotically false-positive-maximizing attack on non-binary tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
A new soft decision tracing algorithm for binary fingerprinting codes
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Accusation probabilities in Tardos codes: beyond the Gaussian approximation
Designs, Codes and Cryptography
A simple tracing algorithm for binary fingerprinting code under averaging attack
Proceedings of the first ACM workshop on Information hiding and multimedia security
Optimal suspicion functions for tardos traitor tracing schemes
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
G. Tardos [1] was the first to give a construction of a fingerprinting code whose length meets the lowest known bound in $O(c^{2}\log\frac{n}{\epsilon_{1}})$. This was a real breakthrough because the construction is very simple. Its efficiency comes from its probabilistic nature. However, although G. Tardos almost gave no argument of his rationale, many parameters of his code are precisely fine-tuned. This paper proposes this missing rationale supporting the code construction. The key idea is to render the statistics of the scores as independent as possible from the collusion process. Tardos optimal parameters are rediscovered. This interpretation allows small improvements when some assumptions hold on the collusion process.