IBM Systems Journal
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
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
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
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
Rebound on Symmetric Tardos Codes
IIH-MSP '12 Proceedings of the 2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
| Hi-index | 0.00 |
To trace back copyright infringements, digital transaction watermarking today is a widely accepted method. Here, copies of a single work are individualized by embedding userspecific watermark messages. However, transaction watermarking is vulnerable to collusion attacks, where multiple individualized copies of one work are compared and/or combined to attack the integrity or availability of the embedded watermark message. To resist such attacks one may apply so called fingerprinting codes. These are mathematical codes that achieve collusion resistance by i.e. enforcing a higher payload. But due to the payload limitations of many multimedia files, e.g. short audio files or images, reducing the code length of fingerprinting codes is of immense importance. The reduction of only few bits may make the difference whether a fingerprint message can be embedded to ensure collusion security or not. In this work we propose a combined tracing algorithm of Škorić et al [13] and Meerwald and Furon [9] based on the fingerprint generation process of [4]. To combine these algorithms, [13] and [9] have been modified according to this manner. For the same error rates as in [9], we achieve both a significant reduction in the code length as well as an improvement of the decoding performance. Additionally, our joint decoding tracing strategy also works for collusion sizes larger than 8.