Paper 2012/249

Binary and q-ary Tardos codes, revisited

Boris Skoric and Jan-Jaap Oosterwijk

Abstract

The Tardos code is a much studied collusion-resistant fingerprinting code, with the special property that it has asymptotically optimal length $m\propto c_0^2$, where $c_0$ is the number of colluders. In this paper we give alternative security proofs for the Tardos code, working with the assumption that the strongest coalition strategy is position-independent. We employ the Bernstein inequality and Bennett inequality instead of the typically used Markov inequality. This proof technique requires fewer steps and slightly improves the tightness of the bound on the false negative error probability. We present new results on code length optimization, for both small and asymptotically large coalition sizes.

Note: Correction of Lemma 6.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
collusionwatermarkingfingerprinting
Contact author(s)
b skoric @ tue nl
History
2013-06-27: last of 3 revisions
2012-05-03: received
See all versions
Short URL
https://ia.cr/2012/249
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/249,
      author = {Boris Skoric and Jan-Jaap Oosterwijk},
      title = {Binary and q-ary Tardos codes, revisited},
      howpublished = {Cryptology ePrint Archive, Paper 2012/249},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/249}},
      url = {https://eprint.iacr.org/2012/249}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.