A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users

Hiroki KOGA; Yusuke MINAMI

doi:10.1587/transfun.E94.A.223

A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users

Hiroki KOGA, Yusuke MINAMI

Full Text Views

0

Cite this

Summary :

In this paper we unveil basic properties of a code Γ_q for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c = 2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c ≥ 3. Relationships between Γ_q and other existing classes of codes are discussed as well.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.1 pp.223-232

Publication Date: 2011/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E94.A.223

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Digital Fingerprinting

Cite this

Copy

Hiroki KOGA, Yusuke MINAMI, "A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users" in IEICE TRANSACTIONS on Fundamentals, vol. E94-A, no. 1, pp. 223-232, January 2011, doi: 10.1587/transfun.E94.A.223.
Abstract: In this paper we unveil basic properties of a code Γ_q for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c = 2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c ≥ 3. Relationships between Γ_q and other existing classes of codes are discussed as well.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.223/_p

Copy

@ARTICLE{e94-a_1_223,
author={Hiroki KOGA, Yusuke MINAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users},
year={2011},
volume={E94-A},
number={1},
pages={223-232},
abstract={In this paper we unveil basic properties of a code Γ_q for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c = 2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c ≥ 3. Relationships between Γ_q and other existing classes of codes are discussed as well.},
keywords={},
doi={10.1587/transfun.E94.A.223},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 223
EP - 232
AU - Hiroki KOGA
AU - Yusuke MINAMI
PY - 2011
DO - 10.1587/transfun.E94.A.223
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - In this paper we unveil basic properties of a code Γ_q for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c = 2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c ≥ 3. Relationships between Γ_q and other existing classes of codes are discussed as well.
ER -