Watermarking Security: Attacks
Bas, Patrick; Furon, Teddy; Cayre, François; Doërr, Gwenaël; Mathon, Benjamin
2016-06-22 00:00:00
[This chapter presents different ways to attack watermarking schemes and to estimate the secret key. One of the pioneering key estimation attack [1] consisted in estimating a set of secret carriers used in Spread Spectrum using Independent Component Analysis. The second section proposes to estimate more complex secret keys generated from dirty paper watermarking schemes using clustering methods. The third section proposes a security attack on Broken Arrows, the system used during the BOWS2 contest using a subspace estimation approach (see Table 5.1).]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/watermarking-security-attacks-ppjA2MG72d
[This chapter presents different ways to attack watermarking schemes and to estimate the secret key. One of the pioneering key estimation attack [1] consisted in estimating a set of secret carriers used in Spread Spectrum using Independent Component Analysis. The second section proposes to estimate more complex secret keys generated from dirty paper watermarking schemes using clustering methods. The third section proposes a security attack on Broken Arrows, the system used during the BOWS2 contest using a subspace estimation approach (see Table 5.1).]
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.