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.
Category / Keywords: collusion, watermarking, fingerprinting Date: received 3 May 2012, last revised 16 May 2013 Contact author: b skoric at tue nl Available formats: PDF | BibTeX Citation Note: Small improvements. Version: 20130516:120313 (All versions of this report) Discussion forum: Show discussion | Start new discussion