Dynamic Tardos Traitor Tracing Schemes

DOI10.1109/TIT.2013.2251756MaRDI QIDQ5346455zbMATH OpenOpenAlexFDO

Authors Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Škorić, Benne de Weger

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.3597

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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.

Cited in

(5)

• On a traitor tracing scheme from ACISP 2003
• scientific article; zbMATH DE number 1842486 (Why is no real title available?)
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• False negative probabilities in Tardos codes
• scientific article; zbMATH DE number 1618051 (Why is no real title available?)

This page was built for publication: Dynamic Tardos Traitor Tracing Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346455)