Hierarchical construction of tardos code

Naoyuki Akashi, Minoru Kuribayashi, Masakatu Morii

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Tardos proposed binary codes for fingerprinting with a code length of theoretically minimum order, and the related works mainly focused on the reduction of the code length were presented. We presented a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. We also introduced a hierarchical structure to the codewords for the reduction of computational costs. However, there were room for improvement of the code-length of this structure. In this paper, we present the optimized hierarchical structure considering appropriate parameters under the assumption that the distribution of correlation scores follows Gaussian. In a computer simulation, we evaluate the collusion-resistance of optimized Tardos code and that of original non-layered Tardos code under theoretically equal condition.

Original languageEnglish
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
Duration: Dec 7 2008Dec 10 2008

Other

Other2008 International Symposium on Information Theory and its Applications, ISITA2008
CountryNew Zealand
CityAuckland
Period12/7/0812/10/08

Fingerprint

Binary codes
Concretes
Computer simulation
Costs

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Akashi, N., Kuribayashi, M., & Morii, M. (2008). Hierarchical construction of tardos code. In 2008 International Symposium on Information Theory and its Applications, ISITA2008 [4895496] https://doi.org/10.1109/ISITA.2008.4895496

Hierarchical construction of tardos code. / Akashi, Naoyuki; Kuribayashi, Minoru; Morii, Masakatu.

2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895496.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Akashi, N, Kuribayashi, M & Morii, M 2008, Hierarchical construction of tardos code. in 2008 International Symposium on Information Theory and its Applications, ISITA2008., 4895496, 2008 International Symposium on Information Theory and its Applications, ISITA2008, Auckland, New Zealand, 12/7/08. https://doi.org/10.1109/ISITA.2008.4895496
Akashi N, Kuribayashi M, Morii M. Hierarchical construction of tardos code. In 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008. 4895496 https://doi.org/10.1109/ISITA.2008.4895496
Akashi, Naoyuki ; Kuribayashi, Minoru ; Morii, Masakatu. / Hierarchical construction of tardos code. 2008 International Symposium on Information Theory and its Applications, ISITA2008. 2008.
@inproceedings{c7ba71b74fe24a6bbac92ff59983f16e,
title = "Hierarchical construction of tardos code",
abstract = "Tardos proposed binary codes for fingerprinting with a code length of theoretically minimum order, and the related works mainly focused on the reduction of the code length were presented. We presented a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. We also introduced a hierarchical structure to the codewords for the reduction of computational costs. However, there were room for improvement of the code-length of this structure. In this paper, we present the optimized hierarchical structure considering appropriate parameters under the assumption that the distribution of correlation scores follows Gaussian. In a computer simulation, we evaluate the collusion-resistance of optimized Tardos code and that of original non-layered Tardos code under theoretically equal condition.",
author = "Naoyuki Akashi and Minoru Kuribayashi and Masakatu Morii",
year = "2008",
doi = "10.1109/ISITA.2008.4895496",
language = "English",
isbn = "9781424420698",
booktitle = "2008 International Symposium on Information Theory and its Applications, ISITA2008",

}

TY - GEN

T1 - Hierarchical construction of tardos code

AU - Akashi, Naoyuki

AU - Kuribayashi, Minoru

AU - Morii, Masakatu

PY - 2008

Y1 - 2008

N2 - Tardos proposed binary codes for fingerprinting with a code length of theoretically minimum order, and the related works mainly focused on the reduction of the code length were presented. We presented a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. We also introduced a hierarchical structure to the codewords for the reduction of computational costs. However, there were room for improvement of the code-length of this structure. In this paper, we present the optimized hierarchical structure considering appropriate parameters under the assumption that the distribution of correlation scores follows Gaussian. In a computer simulation, we evaluate the collusion-resistance of optimized Tardos code and that of original non-layered Tardos code under theoretically equal condition.

AB - Tardos proposed binary codes for fingerprinting with a code length of theoretically minimum order, and the related works mainly focused on the reduction of the code length were presented. We presented a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. We also introduced a hierarchical structure to the codewords for the reduction of computational costs. However, there were room for improvement of the code-length of this structure. In this paper, we present the optimized hierarchical structure considering appropriate parameters under the assumption that the distribution of correlation scores follows Gaussian. In a computer simulation, we evaluate the collusion-resistance of optimized Tardos code and that of original non-layered Tardos code under theoretically equal condition.

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

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

U2 - 10.1109/ISITA.2008.4895496

DO - 10.1109/ISITA.2008.4895496

M3 - Conference contribution

SN - 9781424420698

BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008

ER -