Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
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
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
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
Two-level fingerprinting codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
IEEE Transactions on Information Forensics and Security
Capacity of collusion secure fingerprinting: a tradeoff between rate and efficiency
IH'10 Proceedings of the 12th international conference on Information hiding
Asymptotic fingerprinting capacity for non-binary alphabets
IH'11 Proceedings of the 13th international conference on Information hiding
Asymptotic fingerprinting capacity in the combined digit model
IH'12 Proceedings of the 14th international conference on Information Hiding
| Hi-index | 754.84 |
We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attacker coalition. Lower bounds are obtained by considering typical coalitions, which represents a new idea in the area of fingerprinting and enables us to improve the previously known lower bounds for coalitions of size two and three. For upper bounds, the fingerprinting problem is modeled as a communications problem. It is shown that the maximum code rate is bounded above by the capacity of a certain class of channels, which are similar to the multiple-access channel (MAC). Converse coding theorems proved in the paper provide new upper bounds on fingerprinting capacity. It is proved that capacity for fingerprinting against coalitions of size two and three over the binary alphabet satisfies and , respectively. For coalitions of an arbitrary fixed size , we derive an upper bound on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting capacity involving only single-letter mutual information quantities.