Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Laarhoven et al. (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: