TY - BOOK

T1 - Binary and q-ary Tardos codes, revisited

AU - Oosterwijk, J.

AU - Skoric, B.

PY - 2012

Y1 - 2012

N2 - 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 simplify the security proofs for this code, making use of the Bernstein inequality and Bennett inequality instead of the typically used Markov inequality. This simplified proof technique also 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.
Keywords: collusion, watermarking, fingerprinting

AB - 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 simplify the security proofs for this code, making use of the Bernstein inequality and Bennett inequality instead of the typically used Markov inequality. This simplified proof technique also 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.
Keywords: collusion, watermarking, fingerprinting

M3 - Report

T3 - Cryptology ePrint Archive

BT - Binary and q-ary Tardos codes, revisited

PB - s.n.

ER -