Dynamic traitor tracing for arbitrary alphabets: divide and conquer

T.M.M. Laarhoven, Jan-Jaap Oosterwijk, Jeroen Doumen

Research output: Book/ReportReportAcademic

46 Downloads (Pure)

Abstract

We give a generic divide-and-conquer approach for constructing collusion-resistant probabilistic dynamic traitor tracing schemes with larger alphabets from schemes with smaller alphabets. This construction offers a linear tradeoff between the alphabet size and the codelength. In particular, we show that applying our results to the binary dynamic Tardos scheme of Laarhoven et al. leads to schemes that are shorter by a factor equal to half the alphabet size. Asymptotically, these codelengths correspond, up to a constant factor, to the fingerprinting capacity for static probabilistic schemes. This gives a hierarchy of probabilistic dynamic traitor tracing schemes, and bridges the gap between the low bandwidth, high codelength scheme of Laarhoven et al. and the high bandwidth, low codelength scheme of Fiat and Tassa.
Original languageEnglish
Number of pages6
Publication statusPublished - 2012

Publication series

NamearXiv.org
Volume1206.6702 [cs.CR]

Fingerprint Dive into the research topics of 'Dynamic traitor tracing for arbitrary alphabets: divide and conquer'. Together they form a unique fingerprint.

Cite this