The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Koji NUIDA, Satoshi FUJITSU, Manabu HAGIWARA, Hideki IMAI, Takashi KITAGAWA, Kazuto OGAWA, Hajime WATANABE, "An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 1, pp. 197-206, January 2009, doi: 10.1587/transfun.E92.A.197.
Abstract: The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.197/_p
Copy
@ARTICLE{e92-a_1_197,
author={Koji NUIDA, Satoshi FUJITSU, Manabu HAGIWARA, Hideki IMAI, Takashi KITAGAWA, Kazuto OGAWA, Hajime WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation},
year={2009},
volume={E92-A},
number={1},
pages={197-206},
abstract={The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.},
keywords={},
doi={10.1587/transfun.E92.A.197},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 197
EP - 206
AU - Koji NUIDA
AU - Satoshi FUJITSU
AU - Manabu HAGIWARA
AU - Hideki IMAI
AU - Takashi KITAGAWA
AU - Kazuto OGAWA
AU - Hajime WATANABE
PY - 2009
DO - 10.1587/transfun.E92.A.197
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2009
AB - The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.
ER -