@inproceedings{9e39c8cf8ce346d3baf66c5c9af45963,
title = "Worst-case optimal fingerprinting codes for non-threshold collusion",
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.",
author = "Takaaki Mizuki and Satoshi Nounin and Hideaki Sone and Yousuke Toyota",
year = "2006",
doi = "10.1007/11787952_16",
language = "English",
isbn = "3540359982",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "203--216",
booktitle = "Digital Rights Management",
address = "Germany",
note = "1st International Conference on Digital Rights Management: Technologies, Issues Challenges and Systems, DRMTICS 2005 ; Conference date: 31-10-2005 Through 02-11-2005",
}