Best Security Index for Digital Fingerprinting

Kozo BANNO; Shingo ORIHARA; Takaaki MIZUKI; Takao NISHIZEKI

doi:10.1093/ietfec/e89-a.1.169

Best Security Index for Digital Fingerprinting

Kozo BANNO, Shingo ORIHARA, Takaaki MIZUKI, Takao NISHIZEKI

Full Text Views

0

Share
Cite this

Summary :

Digital watermarking used for fingerprinting may receive a collusion attack; two or more users collude, compare their data, find a part of embedded watermarks, and make an unauthorized copy by masking their identities. In this paper, assuming that at most c users collude, we give a characterization of the fingerprinting codes that have the best security index in a sense of "(c,p/q)-secureness" proposed by Orihara et al. The characterization is expressed in terms of intersecting families of sets. Using a block design, we also show that a distributor of data can only find asymptotically a set of c users including at least one culprit, no matter how good fingerprinting code is used.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.1 pp.169-177

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.1.169

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

Category: Information Hiding

Cite this

Copy

Kozo BANNO, Shingo ORIHARA, Takaaki MIZUKI, Takao NISHIZEKI, "Best Security Index for Digital Fingerprinting" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 1, pp. 169-177, January 2006, doi: 10.1093/ietfec/e89-a.1.169.
Abstract: Digital watermarking used for fingerprinting may receive a collusion attack; two or more users collude, compare their data, find a part of embedded watermarks, and make an unauthorized copy by masking their identities. In this paper, assuming that at most c users collude, we give a characterization of the fingerprinting codes that have the best security index in a sense of "(c,p/q)-secureness" proposed by Orihara et al. The characterization is expressed in terms of intersecting families of sets. Using a block design, we also show that a distributor of data can only find asymptotically a set of c users including at least one culprit, no matter how good fingerprinting code is used.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.1.169/_p

Copy

@ARTICLE{e89-a_1_169,
author={Kozo BANNO, Shingo ORIHARA, Takaaki MIZUKI, Takao NISHIZEKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Best Security Index for Digital Fingerprinting},
year={2006},
volume={E89-A},
number={1},
pages={169-177},
abstract={Digital watermarking used for fingerprinting may receive a collusion attack; two or more users collude, compare their data, find a part of embedded watermarks, and make an unauthorized copy by masking their identities. In this paper, assuming that at most c users collude, we give a characterization of the fingerprinting codes that have the best security index in a sense of "(c,p/q)-secureness" proposed by Orihara et al. The characterization is expressed in terms of intersecting families of sets. Using a block design, we also show that a distributor of data can only find asymptotically a set of c users including at least one culprit, no matter how good fingerprinting code is used.},
keywords={},
doi={10.1093/ietfec/e89-a.1.169},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Best Security Index for Digital Fingerprinting
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 169
EP - 177
AU - Kozo BANNO
AU - Shingo ORIHARA
AU - Takaaki MIZUKI
AU - Takao NISHIZEKI
PY - 2006
DO - 10.1093/ietfec/e89-a.1.169
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2006
AB - Digital watermarking used for fingerprinting may receive a collusion attack; two or more users collude, compare their data, find a part of embedded watermarks, and make an unauthorized copy by masking their identities. In this paper, assuming that at most c users collude, we give a characterization of the fingerprinting codes that have the best security index in a sense of "(c,p/q)-secureness" proposed by Orihara et al. The characterization is expressed in terms of intersecting families of sets. Using a block design, we also show that a distributor of data can only find asymptotically a set of c users including at least one culprit, no matter how good fingerprinting code is used.
ER -