Short 3-Secure Fingerprinting Codes for Copyright Protection
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
A family of collusion 2-secure codes
IH'05 Proceedings of the 7th international conference on Information Hiding
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
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
Optimal suspicion functions for tardos traitor tracing schemes
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pirate tracing algorithm combines a scoring method analogous to Tardos codes with an extension of parent search techniques of some preceding 2-secure codes. Numerical examples show that our code lengths are significantly shorter than (about 30% to 40% of) the shortest known c-secure codes by Nuida et al. (Des. Codes Cryptogr., 2009) with c = 3. Some preliminary proposal for improving efficiency of our tracing algorithm is also given.