Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
On the Fingerprinting Capacity Under the Marking Assumption
IEEE Transactions on Information Theory
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
Digital fingerprinting under and (somewhat) beyond the marking assumption
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Watermarking for adaptive streaming protocols
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
Asymptotic fingerprinting capacity for non-binary alphabets
IH'11 Proceedings of the 13th international conference on Information hiding
Asymptotically false-positive-maximizing attack on non-binary tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
Fast and adaptive tracing strategies for 3-secure fingerprint watermarking codes
Proceedings of the 11th annual ACM workshop on Digital rights management
Accusation probabilities in Tardos codes: beyond the Gaussian approximation
Designs, Codes and Cryptography
Performance and code length optimization of joint decoding tardos fingerprinting
Proceedings of the on Multimedia and security
Asymptotic fingerprinting capacity in the combined digit model
IH'12 Proceedings of the 14th international conference on Information Hiding
Leakage detection and tracing for databases
Proceedings of the first ACM workshop on Information hiding and multimedia security
Optimal symmetric Tardos traitor tracing schemes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We study a fingerprinting game in which the collusion channel is unknown. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace back pirated copies to the colluders. Fingerprinting capacity has recently been derived as the limit value of a sequence of maxmin games with mutual information as the payoff function. However, these games generally do not admit saddle-point solutions and are very hard to solve numerically. Here under the so-called Boneh-Shaw marking assumption, we reformulate the capacity as the value of a single two-person zero-sum game, and show that it is achieved by a saddle-point solution. If the maximal coalition size is k and the fingerprint alphabet is binary, we derive equations that can numerically solve the capacity game for arbitrary k. We also provide tight upper and lower bounds on the capacity. Finally, we discuss the asymptotic behavior of the fingerprinting game for large k and practical implementation issues.