EM decoding of tardos traitor tracing codes
Proceedings of the 11th ACM workshop on Multimedia and security
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
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
Optimal suspicion functions for tardos traitor tracing schemes
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as improved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information between the code sequence of a colluder and the pirated sequence. Second, an algorithm pertaining to the field of rare event analysis is presented in order to estimate the probabilities of error: the probability that an innocent user is framed, and the probabilities that all colluders are missed. Therefore, for a given collusion size, we are able to estimate the minimal length of the code satisfying some error probabilities constraints. This estimation is far lower than the known lower bounds.