Asymmetric fingerprinting for larger collusions
Proceedings of the 4th ACM conference on Computer and communications security
A Secure, Robust Watermark for Multimedia
Proceedings of the First International Workshop on Information Hiding
Attacks on Copyright Marking Systems
Proceedings of the Second International Workshop on Information Hiding
Recovery of Watermarks from Distorted Images
IH '99 Proceedings of the Third International Workshop on Information Hiding
IH '99 Proceedings of the Third International Workshop on Information Hiding
An Asymmetric Public Detection Watermarking Technique
IH '99 Proceedings of the Third International Workshop on Information Hiding
Fast Robust Template Matching for Affine Resistant Image Watermarks
IH '99 Proceedings of the Third International Workshop on Information Hiding
Key Independent Watermark Detection
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A general framework for robust watermarking security
Signal Processing - Special section: Security of data hiding technologies
Rights Protection for Categorical Data
IEEE Transactions on Knowledge and Data Engineering
Secure multimedia authoring with dishonest collaborators
EURASIP Journal on Applied Signal Processing
IP Traceback Using Digital Watermark and Honeypot
UIC '08 Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
Many algorithms which mark data in order to enforce copyright protection have recently been proposed. Among these, the family of spread-spectrum based schemes is predominant. This family has an inherent weakness when used to mark several documents: either it changes the key for each document and has to maintain a complex database of keys or it uses the same key for every document and will face collusion attacks. In this paper, we propose a new blind scheme, which embeds different marks in different documents, but allows detection with the help of a single private key. Our scheme can be used on top of most existing spread spectrum based schemes, and is much less prone to collusion attacks than the latters. We also prove that the false positive and false negative detection rates of our protocol are exponentially small. Finally, we believe the mathematical tools used in this article to prove concentration of random variables around their means will be useful for analyzing other watermarking schemes, and that they will be of further use for other problems in cryptology.