Optimal symmetric Tardos traitor tracing schemes
arXiv:1107.3441 · doi:10.1007/s10623-012-9718-y
Abstract
For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Skoric et al. with the improved analysis of Blayer and Tassa we get further improvements. Our construction gives codes that are up to 4 times shorter than Blayer and Tassa's, and up to 2 times shorter than the codes from Skoric et al. Asymptotically, we achieve the theoretical optimal codelength for Tardos' distribution function and the symmetric score function. For large coalitions, our codelengths are asymptotically about 4.93% of Tardos' original codelengths, which also improves upon results from Nuida et al.
16 pages, 1 figure
Cited by in corpus (7)
- Dynamic Tardos Traitor Tracing Schemes
- Capacities and Capacity-Achieving Decoders for Various Fingerprinting Games
- Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer
- Dynamic Traitor Tracing Schemes, Revisited
- Nearest neighbor decoding for Tardos fingerprinting codes
- Asymptotics of Fingerprinting and Group Testing: Capacity-Achieving Log-Likelihood Decoders
- Optimal sequential fingerprinting: Wald vs. Tardos