Robustness Evaluation of Spread-Spectrum Watermarking against Collusion Attack
Robustness Evaluation of Spread-Spectrum Watermarking against Collusion Attack
复制标题
扩频水印对抗共谋攻击的鲁棒性评估
DOI:
10.1143/jpsj.81.035005
复制
发表时间:
2012
影响因子:
1.7
通讯作者:
Mimura,K.
中科院分区:
文献类型:
--
作者:
Sakai,Y.;Mimura,K.
As the network technology advances, so many digital contents, such as audio, image and video, can be now easily accessed via the internet. It has become more important to protect the copyright of digital contents. In recent years, the electoronic watermarking 1) attracts attention as one of the solutions to this problem. The watermarking is a method to embed users’ information into the digital contents invisibly. Many kinds of methods have been proposed as the watermarking so far. 2, 3) We here focus on the method based on the spectrum spreading, 4–6) which can embed information into a whole region of the content and can add information into the watermarked content. All operations to remove the embedded information from the watermarked contents are called the attack, eg, the cutout, the scaling, the rotation, the additive noise, and the JPEG compression attacks, etc. If users’ information is not embedded, ill-intentioned users can easily copy digital content and redistribute it. It is therefore important to store users’ information into the contents especially in the context of the fingerprinting. One of the most severe attacks is the collusion attack such that several users having a same content combine their copies to delete the embedded information. 7, 8) The robustness against such attacks is required to the watermarking and the fingerprinting. Namely, the robustness is to be able to keep the embedded information against the attacks, and is evaluated by the bit error rate of the extracted information from the watermarked or fingerprinted contents. In this note, we especially focus on the effect of the collusion attack using the signalto-noise analysis 5, 9) and analyze the performance of the detection algorithm based on the interference cancelling method. 9, 10)We here consider a 256-level gray-scale image f º f fi2FN consisting of N pixels as the content, where F º Ω0: 255ä and Ωa: bä, fn 2 Zja n bg. Suppose that the some K-bit messages are embedded into the same image f and K º O Nfi. The ‘th watermarked image f ‘º f‘fi 2 FN is generated by embedding the ‘th K-bit message b ‘º b ‘; kfi 2 f¿ 1; 1gK into the original image f using spreading codes fs ‘; kg k2Ω1: Kä º f s ‘; kfig 2 f¿ 1; 1gN that are assinged to each message. Namely, the th pixel value of the ‘th watermarked image is given as f‘º f PK