DocumentCode
35019
Title
Dynamic Tardos Traitor Tracing Schemes
Author
Laarhoven, T. ; Doumen, J. ; Roelse, P. ; Skoric, Boris ; de Weger, B.
Author_Institution
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Eindhoven, Netherlands
Volume
59
Issue
7
fYear
2013
fDate
Jul-13
Firstpage
4230
Lastpage
4242
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.
Keywords
codes; watermarking; binary dynamic traitor tracing schemes; codewords; dynamic Tardos traitor tracing schemes; error probability; feedback; pirate network; pirates coalition; traitor tracing code; watermark bits; Data security; Distribution functions; Error probability; Heuristic algorithms; Mathematical model; Upper bound; Watermarking; Broadcasting; coalition; collusion-resistance; fingerprinting; pay-tv; traitor tracing; watermarking;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2013.2251756
Filename
6507628
Link To Document