Dynamic Tardos Traitor Tracing Schemes
arXiv:1111.3597 · doi:10.1109/TIT.2013.2251756
Abstract
We construct binary dynamic traitor tracing schemes, where the number of watermark bits needed to trace and disconnect any coalition of pirates is quadratic in the number of pirates, and logarithmic in the total number of users and the error probability. Our results improve upon results of Tassa, and our schemes have several other advantages, such as being able to generate all codewords in advance, a simple accusation method, and flexibility when the feedback from the pirate network is delayed.
13 pages, 5 figures
References in corpus (1)
Cited by in corpus (9)
- Capacities and Capacity-Achieving Decoders for Various Fingerprinting Games
- Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer
- Efficient Probabilistic Group Testing Based on Traitor Tracing
- Discrete Distributions in the Tardos Scheme, Revisited
- 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
- A New Key Establishment Protocol and its Application in Pay-TV Systems