TY - GEN
T1 - A new approach to countering ambiguity attacks
AU - Sencar, Husrev Taha
AU - Li, Qiming
AU - Memon, Nasir
PY - 2007
Y1 - 2007
N2 - Watermarking based ownership dispute resolution schemes are vulnerable to a simple but effective class of attacks, called ambiguity attacks, which cast doubt on the reliability of resulting decision by exploiting the high false-positive rate of the watermarking scheme. To mitigate such attacks, we propose a new scheme that embeds multiple watermarks, as opposed to embedding a single watermark, while constraining the embedding distortion, and detects a randomly selected subset of them during an ownership proof. The crux of the scheme lies in both watermark generation, which deploys a family of one-way functions, and selective detection, which injects uncertainty to detection process. The reduction in false-positive probability is analyzed and compared to single watermark embedding for the additive watermarking technique through numerical solutions. Moreover, we examine the exact security level that can be achieved by our scheme with different combinations of parameters. We adopt a previous security proof of non-invertible watermarking schemes with modified notion of security that is more realistic in practice, which allows us to derive the achievable security with typical parameters.
AB - Watermarking based ownership dispute resolution schemes are vulnerable to a simple but effective class of attacks, called ambiguity attacks, which cast doubt on the reliability of resulting decision by exploiting the high false-positive rate of the watermarking scheme. To mitigate such attacks, we propose a new scheme that embeds multiple watermarks, as opposed to embedding a single watermark, while constraining the embedding distortion, and detects a randomly selected subset of them during an ownership proof. The crux of the scheme lies in both watermark generation, which deploys a family of one-way functions, and selective detection, which injects uncertainty to detection process. The reduction in false-positive probability is analyzed and compared to single watermark embedding for the additive watermarking technique through numerical solutions. Moreover, we examine the exact security level that can be achieved by our scheme with different combinations of parameters. We adopt a previous security proof of non-invertible watermarking schemes with modified notion of security that is more realistic in practice, which allows us to derive the achievable security with typical parameters.
KW - Ambiguity attack
KW - Security
KW - Watermarking
UR - http://www.scopus.com/inward/record.url?scp=38849206158&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38849206158&partnerID=8YFLogxK
U2 - 10.1145/1288869.1288898
DO - 10.1145/1288869.1288898
M3 - Conference contribution
AN - SCOPUS:38849206158
SN - 9781595938572
T3 - MM and Sec'07 - Proceedings of the Multimedia and Security Workshop 2007
SP - 205
EP - 214
BT - MM and Sec'07 - Proceedings of the Multimedia and Security Workshop 2007
T2 - MM and Sec'07 - 9th Multimedia and Security Workshop 2007
Y2 - 20 September 2007 through 21 September 2007
ER -