A New Class of Traceability Schemes for Protecting Digital Content against Illegal Re-distribution

Summary Traceability schemes are used to protect the rights of intellectual-property owners against illegal re-distribution. In order to trace a pirate copy back to a user who has been involved in making and re-distributing the pirate copy, a traceability scheme requires a code which contains a sufficient number of codewords and a traitor-tracing algorithm. Codes with the identifiable parent property (IPP codes) and traceability codes (TA codes) have been extensively studied. IPP codes include all TA codes as special instances. However, TA codes usually implement efficient tracing algorithms, while IPP codes do not always have efficient tracing algorithms. A major theoretical challenge is to derive more codes which have efficient tracing algorithms. The contributions of this paper include a new class of traceability codes, as well as an efficient tracing algorithm for the new traceability codes. The proposed tracing algorithm has the same complexity as the traditional tracing algorithm and can outperform the traditional tracing algorithm.

[1]  John Yearwood,et al.  New Traceability Codes and Identification Algorithm for Tracing Pirates , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[2]  Jean-Paul M. G. Linnartz,et al.  On Codes with the Identifiable Parent Property , 1998, J. Comb. Theory, Ser. A.

[3]  Paul A. Watters,et al.  Detecting and Tracing Copyright Infringements in P2P Networks , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

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

[5]  Xin-Wen Wu,et al.  Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes , 2001, IEEE Trans. Inf. Theory.

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

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

[8]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[9]  Chandrika Kamath,et al.  Scientific Data Mining - A Practical Perspective , 2009 .

[10]  Margreta Kuijper,et al.  On the decoding radius of Lee-metric decoding of algebraic-geometric codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

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

[13]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[14]  Margreta Kuijper,et al.  Lee-metric decoding of BCH and Reed-Solomon codes , 2003 .

[15]  Miguel Soriano,et al.  Algorithm to decode 'identifiable parent property' codes , 2002 .

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

[17]  Alexander Barg,et al.  Digital fingerprinting codes: problem statements, constructions, identification of traitors , 2003, IEEE Trans. Inf. Theory.

[18]  Amos Fiat,et al.  Dynamic Traitor Tracing , 2001, Journal of Cryptology.

[19]  Miguel Soriano,et al.  Tracing illegal redistribution using errors-anderasures and side information decoding algorithms , 2007, IET Inf. Secur..

[20]  Paul H. Siegel,et al.  Lee-metric BCH codes and their application to constrained and partial-response channels , 1994, IEEE Trans. Inf. Theory.