Computer Science – Cryptography and Security
Scientific paper
2011-11-15
Computer Science
Cryptography and Security
13 pages, 5 figures
Scientific paper
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.
Doumen Jeroen
Laarhoven Thijs
Roelse Peter
Skoric Boris
Weger Benne de
No associations
LandOfFree
Dynamic Tardos Traitor Tracing Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Tardos Traitor Tracing Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Tardos Traitor Tracing Schemes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-709909