On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
Digital watermarking
Attacks on Copyright Marking Systems
Proceedings of the Second International Workshop on Information Hiding
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
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
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
IEEE Transactions on Information Theory
Fast and adaptive tracing strategies for 3-secure fingerprint watermarking codes
Proceedings of the 11th annual ACM workshop on Digital rights management
| Hi-index | 0.00 |
Digital transaction watermarking today is a widely accepted mechanism in multimedia security. Here, copies of one work are distributed with individual markings. One major threat on transaction watermarking are collusion attacks. Here multiple individualized copies of the work are mixed in order to create a counterfeited or undetectable watermark. One common countermeasure is the usage of so-called fingerprint codes. The important challenge is to provide fingerprints which are highly secure, reliable and, at the same time, provide a sufficiently compact code length according to the typical payload limitations of common watermarking algorithms. We present an approach that is collusion-secure against two colluders based on special conditions on the Hamming distances between the user fingerprint. Theoretical and empirical analysis shows that our approach provides the false positive rate to be zero although the false negatives remain similar to other approaches in the literature. The respective code length remains smaller than 100 bit such that our approach is applicable in transaction watermarking scenarios.