In this paper, we propose an adaptive collusion attack to a block oriented watermarking scheme [1]. In this attack, traitors conspire to selectively manipulate watermarked blocks to remove the watermark information. To this end, the traitors compare the watermarked blocks generated from the same original block. If two watermarked block are not equal, they average these two blocks to generate a pirated block. Then, replace the watermarked blocks with the pirated blocks so as to build a pirated image. The pirated image has no watermark but has much higher quality than watermarked images. We also give a theoretical analysis on the probability of successful traitor tracing. Both theoretical and experimental results demonstrate that our attack is very effective when four or more traitors are involved in the collusion attack. In the cases of less than four traitors, we show how to integrate our collusion attack with an adaptive random attack to improve the qualities of pirated images as well as to defeat the tracer. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Wu, Y., & Deng, R. (2003). Adaptive collusion attack to a block oriented watermarking scheme 54. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2836, 238–248. https://doi.org/10.1007/978-3-540-39927-8_22
Mendeley helps you to discover research relevant for your work.