Systematic Generation of Tardos's Fingerprint Codes
Summary :
Digital fingerprinting is used to trace back illegal users, where unique ID known as digital fingerprints is embedded into a content before distribution. On the generation of such fingerprints, one of the important properties is collusion-resistance. Binary codes for fingerprinting with a code length of theoretically minimum order were proposed by Tardos, and the related works mainly focused on the reduction of the code length were presented. In this paper, we present a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. Using a statistical model for correlation scores, the actual number of true-positive and false-positive detection is measured. The collusion-resistance of the generated fingerprinting codes is evaluated by a computer simulation.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.2 pp.508-515
- Publication Date
- 2010/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.508
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Minoru KURIBAYASHI, Masakatu MORII, "Systematic Generation of Tardos's Fingerprint Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 2, pp. 508-515, February 2010, doi: 10.1587/transfun.E93.A.508.
Abstract: Digital fingerprinting is used to trace back illegal users, where unique ID known as digital fingerprints is embedded into a content before distribution. On the generation of such fingerprints, one of the important properties is collusion-resistance. Binary codes for fingerprinting with a code length of theoretically minimum order were proposed by Tardos, and the related works mainly focused on the reduction of the code length were presented. In this paper, we present a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. Using a statistical model for correlation scores, the actual number of true-positive and false-positive detection is measured. The collusion-resistance of the generated fingerprinting codes is evaluated by a computer simulation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.508/_p
Copy
@ARTICLE{e93-a_2_508,
author={Minoru KURIBAYASHI, Masakatu MORII, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Systematic Generation of Tardos's Fingerprint Codes},
year={2010},
volume={E93-A},
number={2},
pages={508-515},
abstract={Digital fingerprinting is used to trace back illegal users, where unique ID known as digital fingerprints is embedded into a content before distribution. On the generation of such fingerprints, one of the important properties is collusion-resistance. Binary codes for fingerprinting with a code length of theoretically minimum order were proposed by Tardos, and the related works mainly focused on the reduction of the code length were presented. In this paper, we present a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. Using a statistical model for correlation scores, the actual number of true-positive and false-positive detection is measured. The collusion-resistance of the generated fingerprinting codes is evaluated by a computer simulation.},
keywords={},
doi={10.1587/transfun.E93.A.508},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Systematic Generation of Tardos's Fingerprint Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 508
EP - 515
AU - Minoru KURIBAYASHI
AU - Masakatu MORII
PY - 2010
DO - 10.1587/transfun.E93.A.508
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2010
AB - Digital fingerprinting is used to trace back illegal users, where unique ID known as digital fingerprints is embedded into a content before distribution. On the generation of such fingerprints, one of the important properties is collusion-resistance. Binary codes for fingerprinting with a code length of theoretically minimum order were proposed by Tardos, and the related works mainly focused on the reduction of the code length were presented. In this paper, we present a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. Using a statistical model for correlation scores, the actual number of true-positive and false-positive detection is measured. The collusion-resistance of the generated fingerprinting codes is evaluated by a computer simulation.
ER -
English
