Error- and Collusion-Secure Fingerprinting for Digital Data
IH '99 Proceedings of the Third International Workshop on Information Hiding
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
Improved versions of Tardos' fingerprinting scheme
Designs, Codes and Cryptography
Optimization of Tardos's fingerprinting codes in a viewpoint of memory amount
IH'07 Proceedings of the 9th international conference on Information hiding
A short random fingerprinting code against a small number of pirates
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
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
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
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
Short collusion-secure fingerprint codes against three pirates
IH'10 Proceedings of the 12th international conference on Information hiding
Tardos's fingerprinting code over AWGN channel
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
Towards joint tardos decoding: the 'don quixote' algorithm
IH'11 Proceedings of the 13th international conference on Information hiding
A new soft decision tracing algorithm for binary fingerprinting codes
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
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
Bias equalizer for binary probabilistic fingerprinting codes
IH'12 Proceedings of the 14th international conference on Information Hiding
A simple tracing algorithm for binary fingerprinting code under averaging attack
Proceedings of the first ACM workshop on Information hiding and multimedia security
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
Optimal symmetric Tardos traitor tracing schemes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
It has been proven that the code lengths of Tardos's collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos's codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos's codes. For example, when c = 8, our code length is about 4.94% of Tardos's code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos's codes.