Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Fingerprinting Capacity Under the Marking Assumption
IEEE Transactions on Information Theory
Bounds on the Number of Users for Random 2-Secure Codes
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Equal-Weight Fingerprinting Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
EM decoding of tardos traitor tracing codes
Proceedings of the 11th ACM workshop on Multimedia and security
An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer 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
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual ACM workshop on Digital rights management
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
Towards joint tardos decoding: the 'don quixote' algorithm
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
Optimal suspicion functions for tardos traitor tracing schemes
Proceedings of the first ACM workshop on Information hiding and multimedia security
Discrete distributions in the tardos scheme, revisited
Proceedings of the first ACM workshop on Information hiding and multimedia security
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 |
Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous constructions. We conjecture that these codes attain the maximum possible rate (the fingerprinting capacity) for any fixed number of pirates. We prove new upper bounds for the fingerprinting capacity that are not far from the rate of our codes. On the downside the accusation algorithm of our codes are much slower than those of earlier codes. We introduce the novel model of weak fingerprinting codes where one pirate should be caught only if the identity of all other pirates are revealed. We construct fingerprinting codes in this model with improved rates but our upper bound on the rate still applies. In fact, these improved codes achieve the fingerprinting capacity of the weak model by a recent upper bound. Using analytic techniques we compare the rates of our codes in the standard model and the rates of the optimal codes in the weak model. To our surprise these rates asymptotically agree, that is, their ratio tends to 1 as t goes to infinity. Although we cannot prove that each one of our codes in the standard model achieves the fingerprinting capacity, this proves that asymptotically they do.