Identification of Traitors Using a Trellis

In a fingerprinting scheme a different set of marks is embedded in each copy of a digital object, in order to deter illegal redistribution. A group of dishonest users, called traitors, collude to create a pirate copy that hides their identities, by putting together different parts of their copies. If the sets to be embedded are the codewords of an error correcting code then efficient algorithms can be used to trace the traitors. In this paper we present a tracing algorithm, that by applying the Viterbi algorithm to the trellis representation of a cyclic traceability code, finds all possibly identifiable traitors.

[1]  Carl-Erik W. Sundberg,et al.  List Viterbi decoding algorithms with applications , 1994, IEEE Trans. Commun..

[2]  Reihaneh Safavi-Naini,et al.  Sequential traitor tracing , 2003, IEEE Trans. Inf. Theory.

[3]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

[4]  Jessica Staddon,et al.  Applications of list decoding to tracing traitors , 2003, IEEE Trans. Inf. Theory.

[5]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[6]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[7]  Jessica Staddon,et al.  Combinatorial properties of frameproof and traceability codes , 2001, IEEE Trans. Inf. Theory.

[8]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.