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

Research and Development Divisions

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	169-177
Number of pages	9
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E89-A
Issue number	1
DOIs	https://doi.org/10.1093/ietfec/e89-a.1.169
Publication status	Published - 2006 Jan

Keywords

Block designs
Collusion attack
Digital watermarking
Fingerprinting
Intersecting families
Security index

ASJC Scopus subject areas

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1093/ietfec/e89-a.1.169

Fingerprint Dive into the research topics of 'Best security index for digital fingerprinting'. Together they form a unique fingerprint.

Cite this

@article{3dc3dfca795b4ee995c4cd430218f8be,

title = "Best security index for digital fingerprinting",

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 = "Block designs, Collusion attack, Digital watermarking, Fingerprinting, Intersecting families, Security index",

author = "Kozo Banno and Shingo Orihara and Takaaki Mizuki and Takao Nishizeki",

year = "2006",

month = jan,

doi = "10.1093/ietfec/e89-a.1.169",

language = "English",

volume = "E89-A",

pages = "169--177",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "1",

}

TY - JOUR

T1 - Best security index for digital fingerprinting

AU - Banno, Kozo

AU - Orihara, Shingo

AU - Mizuki, Takaaki

AU - Nishizeki, Takao

PY - 2006/1

Y1 - 2006/1

N2 - 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.

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.

KW - Block designs

KW - Collusion attack

KW - Digital watermarking

KW - Fingerprinting

KW - Intersecting families

KW - Security index

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

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

U2 - 10.1093/ietfec/e89-a.1.169

DO - 10.1093/ietfec/e89-a.1.169

M3 - Article

AN - SCOPUS:32244434577

VL - E89-A

SP - 169

EP - 177

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -