Asymptotically false-positive-maximizing attack on non-binary Tardos codes

2011/02/02 by Simone, Antonino, Skoric, Boris
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1102.0451

Abstract

We use a method recently introduced by Simone and Skoric 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.

Related

• Tardos fingerprinting is better than we thought
• Optimization of Memory Usage in Tardos's Fingerprinting Codes
• Worst case attacks against binary probabilistic traitor tracing codes
• An Asymmetric Fingerprinting Scheme based on Tardos Codes
• On the Vulnerability of Digital Fingerprinting Systems to Finite Alphabet Collusion Attacks