Soft-decision decoding of traceability codes

In the multimedia content market, there is the need to protect both intellectual property and distribution rights against dishonest buyers. Traitor tracing schemes provide means to find the guilty party in the case of an illegal redistribution. We consider traitor tracing schemes that use error correcting codes, where each user is assigned a unique set of ordered symbols. Since redistributing the set without modification trivially identifies the guilty user, a group of users, aiming to distort their identities, combine their sets and create a new pirate set. In this case, traitor tracing consists in identifying the users whose set agrees the most with the pirate. We present a traitor tracing algorithm that, taking advantage of soft-decision decoding techniques, finds all possibly identifiable traitors, thus extending the capabilities of previously known tracing algorithms.

[1]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[2]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[4]  Amos Fiat,et al.  Tracing traitors , 2000, IEEE Trans. Inf. Theory.

[5]  Jessica Staddon,et al.  Efficient Traitor Tracing Algorithms Using List Decoding , 2001, ASIACRYPT.

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