Worst-case optimal fingerprinting codes for non-threshold collusion

Authors:
Takaaki Mizuki;Satoshi Nounin;Hideaki Sone;Yousuke Toyota
Affiliations:
Information Synergy Center, Tohoku University, Sendai, Japan;Sone Lab., Graduate School of Information Sciences, Tohoku University, Sendai, Japan;Information Synergy Center, Tohoku University, Sendai, Japan;KDDI R&D Laboratories Inc., Saitama, Japan
Venue:
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Year:
2005

Citing 14
Cited 0

Fingerprinting long forgiving messages

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Guessing secrets efficiently via list decoding

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for collusion-secure fingerprinting

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Error- and Collusion-Secure Fingerprinting for Digital Data

IH '99 Proceedings of the Third International Workshop on Information Hiding
A Collusion-Secure Fingerprinting Code Reduced by Chinese Remaindering and Its Random-Error Resilience

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Fingerprinting Concatenated Codes with Efficient Identification

ISC '02 Proceedings of the 5th International Conference on Information Security
Intersecting codes and separating codes

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Bipartite structure of all complex networks

Information Processing Letters
Optimal probabilistic fingerprint codes

Journal of the ACM (JACM)
A survey of watermarking security

IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
A family of collusion 2-secure codes

IH'05 Proceedings of the 7th international conference on Information Hiding
Best security index for digital fingerprinting

IH'05 Proceedings of the 7th international conference on Information Hiding
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates collusion-secure fingerprinting codes for digital data. Most previous works assume the threshold number of collusive users. Whereas, in order to treat a more general non-threshold collusion, we first introduce a notion of a potentially collusive family. Furthermore, we develop a novel way to measure collusion-secure codes according to combinatorial properties in a natural way. Our measurement immediately implies the definition of optimal codes. We then actually illustrate an optimal code. Finally, we give a necessary and sufficient condition for a code to be optimal by using a new notion of family-intersecting codes.