By Topic

A Message-Passing Approach to Combating Desynchronization Attacks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sadasivam, S. ; Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA ; Moulin, P. ; Coleman, T.P.

We propose a new paradigm for blind watermark decoding in the presence of desynchronization attacks. Employing Forney-style factor graphs to model the watermarking system, we cast the blind watermark decoding problem as a probabilistic inference problem on a graph, and solve it via message-passing. We study a wide range of moderate to strong attacks including scaling, amplitude modulation, fractional shift, arbitrary linear and shift-invariant filtering, and blockwise filtering, and show that the graph-based iterative decoders perform almost as well as if they had exact knowledge of the desynchronization attack parameters. Other desirable features of the graph-based decoders include the flexibility to adapt to other types of attacks and the ability to cope with the “curse of dimensionality” problem that seemingly results when the desynchronization parameter space has high dimensionality. These properties are unlike most blind watermark decoders proposed to date.

Published in:

Information Forensics and Security, IEEE Transactions on  (Volume:6 ,  Issue: 3 )