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
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
Estimating the Minimal Length of Tardos Code
Information Hiding
Short collusion-secure fingerprint codes against three pirates
IH'10 Proceedings of the 12th international conference on Information hiding
Asymptotic fingerprinting capacity for non-binary alphabets
IH'11 Proceedings of the 13th international conference on Information hiding
Towards joint tardos decoding: the 'don quixote' algorithm
IH'11 Proceedings of the 13th international conference on Information hiding
An asymmetric fingerprinting scheme based on tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
Accusation probabilities in Tardos codes: beyond the Gaussian approximation
Designs, Codes and Cryptography
Tardos Fingerprinting is Better Than We Thought
IEEE Transactions on Information Theory
Tardos Fingerprinting Codes in the Combined Digit Model
IEEE Transactions on Information Forensics and Security - Part 2
Optimal suspicion functions for tardos traitor tracing schemes
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 |
We investigate alternative suspicion functions for Tardos traitor tracing schemes. In the simple decoder approach (computation of a score for every user independently) we derive suspicion functions that optimize a performance indicator related to the sufficient code length l in the limit of large coalition size c. Our results hold for the Restricted-Digit Model as well as the Combined-Digit Model. The scores depend on information that is usually not available to the tracer -- the attack strategy or the tallies of the symbols received by the colluders. We discuss how such results can be used in realistic contexts. We study several combinations of coalition attack strategy versus suspicion function optimized against some attack (another attack or the same). In many of these combinations the usual scaling l \propto c2 is replaced by a lower power of c, e.g. c3/2. We find that the interleaving strategy is an especially powerful attack, and the suspicion function tailored against interleaving is effective against all considered attacks.