Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18]

@

Journal of Information Science and Engineering, Vol. 25 No. 1, pp. 1-10 (January 2009)

Improved Tracing Algorithm for Random-Error-Resilient Collusion-Secure Fingerprinting Codes*

Ching-Nung Yang and Bing-Ling Lu
Department of Computer Science and Information Engineering
National Dong Hwa University
Hualien, 974 Taiwan

A randomized c-secure CRT (Chinese Remainder Theorem) fingerprinting code was proposed to avoid the illegal copying problem in digital content distribution systems. The tracing algorithm can detect a collusive member from the fingerprinting code generated by a coalition of c malicious users. However, the collusion attack and random errors increase the tracing error rate. In this paper, we improve the algorithm to achieve a more reliable tracing.

Keywords: fingerprinting code, digital content protection, collusion attack, tracing algorithm, Chinese remainder theorem

Full Text () Retrieve PDF document (200901_01.pdf)

Received May 8, 2007; revised April 10, 2008; accepted June 12, 2008.
Communicated by Wen-Guey Tzeng.
* The preliminary version of this paper has been published at P2P Workshop in InfoScale2006, Hong Kong, May, 2006. And this work was supported in part by TWISC@NCKU, NSC under grant No. NSC 97-2219- E-006-009, and the iCAST project under grant No. NSC 97-2745-P-001-001.