On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
SIAM Journal on Discrete Mathematics
An upper bound on the size of a code with the k-identifiable parent property
Journal of Combinatorial Theory Series A
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Combinatorics, Probability and Computing
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Equal-Weight Fingerprinting Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Saddle-point solution of the fingerprinting capacity game under the marking assumption
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper is an extended abstract of the invited talk given by the first-named author. In the first part of the talk we give a general introduction to collusionresistant fingerprinting, discussing problem statements and different sets of assumptions for the digital fingerprinting problem. In the second part we discuss in more detail a combinatorial version of the fingerprinting problem, known as parent-identifying codes. Most earlier works on digital fingerprinting rely on the so-called marking assumption, under which the attackers cannot modify the coordinates in which their fingerprints are identical. We introduce a version of parentidentifying codes for collusion attacks that do not necessarily follow the marking assumption. We show existence of such codes for coalitions of arbitrary size t. Some exact answers are obtained for t = 2 pirates