Dynamic Tardos Traitor Tracing Schemes

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, an...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2013-07, Vol.59 (7), p.4230-4242
Hauptverfasser:	Laarhoven, T., Doumen, J., Roelse, P., Skoric, B., de Weger, B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Broadcasting Broadcasting. Videocommunications. Audiovisual coalition Codes collusion-resistance Cryptography Data security Distribution functions Error probability Exact sciences and technology fingerprinting Heuristic algorithms Information theory Information, signal and communications theory Mathematical model Miscellaneous pay-tv Probability distribution Signal and communications theory Telecommunications Telecommunications and information theory Television traitor tracing Upper bound Watermarking
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2013.2251756