Dynamic Tardos Traitor Tracing Schemes
Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de, Weger
TL;DR
This paper introduces binary dynamic traitor tracing schemes that efficiently identify pirates with fewer watermark bits, improving upon previous methods and offering advantages like pre-generated codewords and flexible feedback handling.
Contribution
It presents new dynamic traitor tracing schemes with quadratic watermark bits in pirates and logarithmic in users, enhancing efficiency and practicality over prior work.
Findings
Quadratic watermark bits in pirates
Logarithmic in total users and error probability
Schemes allow pre-generation and handle delayed feedback
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.