Counterfeiting attacks on oblivious block-wise independent invisible watermarking schemes

被引:292
作者
Holliman, M [1 ]
Memon, N
机构
[1] Intel Corp, Microcomp Res Labs, Santa Clara, CA 95052 USA
[2] Polytech Inst New York, Dept Comp Sci, Brooklyn, NY 11201 USA
关键词
D O I
10.1109/83.826780
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we describe a class of attacks on certain block-based oblivious watermarking schemes. We show that oblivious watermarking techniques that embed information into a host image in a block-wise independent fashion are vulnerable to a counterfeiting attack. Specifically, given a watermarked image, one can forge the watermark it contains into another image without knowing the secret key used for watermark insertion and in some cases even without explicitly knowing the watermark. We demonstrate successful implementations of this attack on a few watermarking techniques that have been proposed in the literature. We also describe a possible solution to this problem of block-wise independence that makes our attack computationally intractable.
引用
收藏
页码:432 / 441
页数:10
相关论文
共 17 条
[1]  
BUSCH C, 1999, COMPUT GRAPH APP JAN, P25
[2]   Secure spread spectrum watermarking for multimedia [J].
Cox, IJ ;
Kilian, J ;
Leighton, FT ;
Shamoon, T .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (12) :1673-1687
[3]  
Fridrich Jiri, 1998, P INT C IM PROC CHIC
[4]   Watermarking of uncompressed and compressed video [J].
Hartung, F ;
Girod, B .
SIGNAL PROCESSING, 1998, 66 (03) :283-301
[5]  
Kalker Ton, 1999, P SPIE, V3657
[6]  
LANGELAAR G, 1996, COPY PROTECTION MULT
[7]  
Miller M.L., 1997, P SPIE, V3016
[8]  
PETITCOLAS F, 1998, P INF HID WORKSH POR
[9]  
RIVEST RL, 1992, INTERNET RFC, V1321
[10]  
SMITH JR, P 1996 WORKSH INF HI