On reliability and security of randomized detectors against sensitivity analysis attacks

Authors:
Maha El Choubassi;Pierre Moulin
Affiliations:
Intel Microprocessor Research Laboratory, Santa Clara, CA;University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE Transactions on Information Forensics and Security
Year:
2009

Citing 5
Cited 0

An introduction to signal detection and estimation (2nd ed.)

An introduction to signal detection and estimation (2nd ed.)
Digital watermarking

Digital watermarking
The return of the sensitivity attack

IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Noniterative Algorithms for Sensitivity Analysis Attacks

IEEE Transactions on Information Forensics and Security
DCT-domain watermarking techniques for still images: detector performance analysis and a new structure

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite their popularity, spread spectrum schemes are vulnerable against sensitivity analysis attacks on standard deterministic watermark detectors. A possible defense is to use a randomized watermark detector. While randomization sacrifices some detection performance, it might be expected to improve detector security to some extent. This paper presents a framework to design randomized detectors with exponentially large randomization space and controllable loss in detection reliability. We also devise a general procedure to attack such detectors by reducing them into equivalent deterministic detectors. We conclude that, contrary to prior belief, randomization of the detector is not the ultimate answer for providing security against sensitivity analysis attacks in spread spectrum systems. Instead, the randomized detector inherits the weaknesses of the equivalent deterministic detector.