An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths

Authors:
Koji Nuida;Satoshi Fujitsu;Manabu Hagiwara;Takashi Kitagawa;Hajime Watanabe;Kazuto Ogawa;Hideki Imai
Affiliations:
Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Chiyoda-ku, Tokyo, Japan;Science & Technical Research Laboratories, Japan Broadcasting Corporation, Setagaya-ku, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Chiyoda-ku, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Chiyoda-ku, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Chiyoda-ku, Tokyo, Japan;Science & Technical Research Laboratories, Japan Broadcasting Corporation, Setagaya-ku, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Chiyoda-ku, Tokyo, Japan and Faculty of Science and Engineering, Chuo University, Bunkyo ...
Venue:
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Year:
2007

Citing 5
Cited 3

Optimal probabilistic fingerprint codes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimization of Tardos's fingerprinting codes in a viewpoint of memory amount

IH'07 Proceedings of the 9th international conference on Information hiding
Combining Tardos fingerprinting codes and fingercasting

IH'07 Proceedings of the 9th international conference on Information hiding
A short random fingerprinting code against a small number of pirates

AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory

EM decoding of tardos traitor tracing codes

Proceedings of the 11th ACM workshop on Multimedia and security
Experimental assessment of the reliability for watermarking and fingerprinting schemes

EURASIP Journal on Information Security
Robust fingerprinting codes: a near optimal construction

Proceedings of the tenth annual ACM workshop on Digital rights management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The code length of Tardos's collusion-secure fingerprinting code (STOC'03) is of theoretically minimal order with respect to the number of malicious users (pirates); however, the constant factor should be further reduced for practical implementation. In this paper we give a collusion-secure fingerprinting code by mixing recent two improvements of Tardos code and modifying their pirates tracing algorithms. Our code length is significantly shorter than Tardos code, especially in the case of fewer pirates. For example, the ratio of our length relative to Tardos code in some practical situation with 4 pirates is 4.33%; while the lowest among the preceding codes in this case (Skoric et al., 2007) is 9.87%.