Dynamic Tardos traitor tracing schemes

T.M.M. Laarhoven, Jeroen Doumen, Peter Roelse, B. Skoric, B.M.M. Weger, de

Research output: Contribution to journalArticleAcademicpeer-review

24 Citations (Scopus)


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. Keywords: Broadcasting; coalition; collusion-resistance; fingerprinting; pay-tv; traitor tracing; watermarking
Original languageEnglish
Pages (from-to)4230-4242
Number of pages13
JournalIEEE Transactions on Information Theory
Issue number7
Publication statusPublished - 2013


Dive into the research topics of 'Dynamic Tardos traitor tracing schemes'. Together they form a unique fingerprint.

Cite this