On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
Digital watermarking
Lower bounds for collusion-secure fingerprinting
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
Tardos Fingerprinting is Better Than We Thought
IEEE Transactions on Information Theory
On-off keying modulation and tardos fingerprinting
Proceedings of the 10th ACM workshop on Multimedia and security
On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes
Information Hiding
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
Experimental assessment of the reliability for watermarking and fingerprinting schemes
EURASIP Journal on Information 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
Proceedings of the 12th ACM workshop on Multimedia and security
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual ACM workshop on Digital rights management
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Experimental assessment of probabilistic fingerprinting codes over AWGN channel
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Capacity of collusion secure fingerprinting: a tradeoff between rate and efficiency
IH'10 Proceedings of the 12th international conference on Information hiding
Short collusion-secure fingerprint codes against three pirates
IH'10 Proceedings of the 12th international conference on Information hiding
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
An asymmetric fingerprinting scheme based on tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
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
Near-Optimal collusion-secure fingerprinting codes for efficiently tracing illegal re-distribution
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
Asymptotic fingerprinting capacity in the combined digit model
IH'12 Proceedings of the 14th international conference on Information Hiding
Bias equalizer for binary probabilistic fingerprinting codes
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 |
Fingerprinting provides a means of tracing unauthorized redistribution of digital data by individually marking each authorized copy with a personalized serial number. In order to prevent a group of users from collectively escaping identification, collusion-secure fingerprinting codes have been proposed. In this paper, we introduce a new construction of a collusion-secure fingerprinting code which is similar to a recent construction by Tardos but achieves shorter code lengths and allows for codes over arbitrary alphabets. We present results for `symmetric' coalition strategies. For binary alphabets and a false accusation probability $$\varepsilon_1$$ , a code length of $$m\approx \pi^2 c_0^2\ln\frac{1}{\varepsilon_1}$$ symbols is provably sufficient, for large c 0, to withstand collusion attacks of up to c 0 colluders. This improves Tardos' construction by a factor of 10. Furthermore, invoking the Central Limit Theorem in the case of sufficiently large c 0, we show that even a code length of $$m\approx 1/2\pi^2 c_0^2\ln\frac{1}{\varepsilon_1}$$ is adequate. Assuming the restricted digit model, the code length can be further reduced by moving from a binary alphabet to a q-ary alphabet. Numerical results show that a reduction of 35% is achievable for q = 3 and 80% for q = 10.