Improved tracing algorithm for random-error-resilient collusion-secure fingerprinting codes in P2P information systems

Ching-Nung   Yang; Bing-Ling  Lu

1st International ICST/Create-Net Workshop on Peer-to-Peer Information Management

Research Article

Improved tracing algorithm for random-error-resilient collusion-secure fingerprinting codes in P2P information systems

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1145/1146847.1146902,
    author={Ching-Nung   Yang and Bing-Ling  Lu},
    title={Improved tracing algorithm for random-error-resilient collusion-secure fingerprinting codes in P2P information systems},
    proceedings={1st International ICST/Create-Net Workshop on Peer-to-Peer Information Management},
    publisher={ACM},
    proceedings_a={P2PIM},
    year={2012},
    month={10},
    keywords={},
    doi={10.1145/1146847.1146902}
}

Ching-Nung Yang
Bing-Ling Lu
Year: 2012
Improved tracing algorithm for random-error-resilient collusion-secure fingerprinting codes in P2P information systems
P2PIM
ACM
DOI: 10.1145/1146847.1146902

Ching-Nung Yang¹^,*, Bing-Ling Lu¹

1: Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan

*Contact email: cnyang@mail.ndhu.edu.tw

Abstract

A randomized c-secure CRT (Chinese Remainder Theorem) fingerprinting code was proposed to avoid the illegal copying of digital content. The tracing algorithm can detect a collusive member from the fingerprinting code generated by a coalition of at most 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.

Published: 2012-10-02
Publisher: ACM

: http://dx.doi.org/10.1145/1146847.1146902