Paper 2013/154

Optimal Suspicion Functions for Tardos Traitor Tracing Schemes

Jan-Jaap Oosterwijk, Boris Skoric, and Jeroen Doumen

Abstract

We investigate alternative suspicion functions for Tardos traitor tracing schemes. In the simple decoder approach (computation of a score for every user independently) we derive suspicion functions that optimize a performance indicator related to the sufficient code length $\ell$ in the limit of large coalition size $c$. Our results hold for the Restricted-Digit Model as well as the Combined-Digit Model. The scores depend on information that is usually not available to the tracer -- the attack strategy or the tallies of the symbols received by the colluders. We discuss how such results can be used in realistic contexts. We study several combinations of coalition attack strategy vs. suspicion function optimized against some attack (another attack or the same). In many of these combinations the usual scaling $\ell \propto c^2$ is replaced by a lower power of $c$, e.g. $c^{3/2}$. We find that the interleaving strategy is an especially powerful attack, and the suspicion function tailored against interleaving is effective against all considered attacks.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. IHMMSEC 2013
Keywords
Traitor tracing
Contact author(s)
J Oosterwijk @ tue nl
History
2013-05-06: revised
2013-03-15: received
See all versions
Short URL
https://ia.cr/2013/154
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/154,
      author = {Jan-Jaap Oosterwijk and Boris Skoric and Jeroen Doumen},
      title = {Optimal Suspicion Functions for Tardos Traitor Tracing Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/154},
      year = {2013},
      url = {https://eprint.iacr.org/2013/154}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.