On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
Lower bounds for collusion-secure fingerprinting
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Large Scale distributed watermarking of multicast media through encryption
Proceedings of the IFIP TC6/TC11 International Conference on Communications and Multimedia Security Issues of the New Century
Chameleon - A New Kind of Stream Cipher
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fingercasting—Joint fingerprinting and decryption of broadcast messages
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Secure watermark embedding through partial encryption
IWDW'06 Proceedings of the 5th international conference on Digital Watermarking
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes
Information Hiding
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
| Hi-index | 0.00 |
Forensic tracking faces new challenges when employed in mass-scale electronic content distribution. In order to avoid a high load at the server, the watermark embedding process should be shifted from the secure server to the client side, where (1) the security of the watermark secrets must be ensured, and (2) collusion-resistance against a reasonably sized coalition of malicious users needs to be guaranteed. The combination of secure content broadcasting, secure embedding and collusion tolerance aspects has been recently addressed and termed as Fingercasting. However, the proposed solution does not apply a special collusion-resistant code, but derives a limited resistance against collusion attacks from the underlying spread spectrum watermark. In this paper, we make the first step towards tackling this problem: we propose a construction that provides collusion-resistance against a large coalition in a secure watermark embedding setting. In particular, we propose to incorporate a variant of the collusion resistant random code of Tardos, currently the code with best asymptotic behavior, into a Fingercasting framework. Through statistical analysis we show that the combination is feasible for a small subset of possible Fingercasting system parameters.