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

Koji Nuida; Satoshi Fujitsu; Manabu Hagiwara; Takashi Kitagawa; Hajime Watanabe; Kazuto Ogawa; Hideki Imai

doi:10.1007/978-3-540-77224-8_12

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

Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, Hideki Imai

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Citations (Scopus)

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 (Škorić et al., 2007) is 9.87%.

Original language	English
Title of host publication	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings
Publisher	Springer Verlag
Pages	80-89
Number of pages	10
ISBN (Print)	9783540772231
DOIs	https://doi.org/10.1007/978-3-540-77224-8_12
Publication status	Published - 2007
Externally published	Yes
Event	17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17 - Bangalore, India Duration: Dec 16 2007 → Dec 20 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4851 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17
Country/Territory	India
City	Bangalore
Period	12/16/07 → 12/20/07

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-77224-8_12

Cite this

Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., & Imai, H. (2007). An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings (pp. 80-89). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4851 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-77224-8_12

An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths. / Nuida, Koji; Fujitsu, Satoshi; Hagiwara, Manabu et al.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings. Springer Verlag, 2007. p. 80-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4851 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nuida, K, Fujitsu, S, Hagiwara, M, Kitagawa, T, Watanabe, H, Ogawa, K & Imai, H 2007, An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths. in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4851 LNCS, Springer Verlag, pp. 80-89, 17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17, Bangalore, India, 12/16/07. https://doi.org/10.1007/978-3-540-77224-8_12

Nuida K, Fujitsu S, Hagiwara M, Kitagawa T, Watanabe H, Ogawa K et al. An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings. Springer Verlag. 2007. p. 80-89. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-77224-8_12

Nuida, Koji ; Fujitsu, Satoshi ; Hagiwara, Manabu et al. / An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings. Springer Verlag, 2007. pp. 80-89 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{975ea8d56e1d47f68218266b72c86b37,

title = "An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths",

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 ({\v S}kori{\'c} et al., 2007) is 9.87%.",

author = "Koji Nuida and Satoshi Fujitsu and Manabu Hagiwara and Takashi Kitagawa and Hajime Watanabe and Kazuto Ogawa and Hideki Imai",

year = "2007",

doi = "10.1007/978-3-540-77224-8_12",

language = "English",

isbn = "9783540772231",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "80--89",

booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings",

address = "Germany",

note = "17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17 ; Conference date: 16-12-2007 Through 20-12-2007",

}

TY - GEN

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

AU - Nuida, Koji

AU - Fujitsu, Satoshi

AU - Hagiwara, Manabu

AU - Kitagawa, Takashi

AU - Watanabe, Hajime

AU - Ogawa, Kazuto

AU - Imai, Hideki

PY - 2007

Y1 - 2007

N2 - 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 (Škorić et al., 2007) is 9.87%.

AB - 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 (Škorić et al., 2007) is 9.87%.

UR - http://www.scopus.com/inward/record.url?scp=38349028852&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38349028852&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77224-8_12

DO - 10.1007/978-3-540-77224-8_12

M3 - Conference contribution

AN - SCOPUS:38349028852

SN - 9783540772231

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 80

EP - 89

BT - Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings

PB - Springer Verlag

T2 - 17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17

Y2 - 16 December 2007 through 20 December 2007

ER -

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

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this