Elements of information theory
Elements of information theory
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
Estimating the Minimal Length of Tardos Code
Information Hiding
An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
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
Bias equalizer for binary probabilistic fingerprinting codes
IH'12 Proceedings of the 14th international conference on Information Hiding
A simple tracing algorithm for binary fingerprinting code under averaging attack
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
This paper proposes a major shift in the decoding of probabilistic Tardos traitor tracing code. The goal of the decoder is to accuse colluders but it ignores how they have been mixing their copies in order to forge the pirated content. As originally proposed by Tardos, so far proposed decoders are agnostic and their performances are stable with respect to this unknown collusion attack. However, this stability automatically leads to non-optimality from a detection theory perspective. This is the reason why this paper proposes to estimate the collusion attack in order to approximate the optimal matched decoder. This is done iteratively thanks to the application of the well-known Expectation-Maximization algorithm. We have dropped the stability: the power of our decoding algorithm deeply depends on the collusion attack. Some attacks are worse than others. However, even for the worst collusion channel, our decoder performs better than the original Tardos decoding.