Best security index for digital fingerprinting

Authors:
Kozo Banno;Shingo Orihara;Takaaki Mizuki;Takao Nishizeki
Affiliations:
Graduate School of Information Sciences, Tohoku University, Sendai, Japan;NTT Information Sharing Platform Laboratories, Tokyo, Japan;Information Synergy Center, Tohoku University, Sendai, Japan;Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Venue:
IH'05 Proceedings of the 7th international conference on Information Hiding
Year:
2005

Citing 4
Cited 1

Design theory

Design theory
Fingerprinting long forgiving messages

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory
Upper bounds on separating codes

IEEE Transactions on Information Theory

Worst-case optimal fingerprinting codes for non-threshold collusion

DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems

Quantified Score

Hi-index	0.00

Visualization

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.