Analysis of digital watermarks subjected to optimum linear filtering and additive noise
Signal Processing - Special section on information theoretic aspects of digital watermarking
Attack modelling: towards a second generation watermarking benchmark
Signal Processing - Special section on information theoretic aspects of digital watermarking
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Robust Covert Communication over a Public Audio Channel Using Spread Spectrum
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
DCC '97 Proceedings of the Conference on Data Compression
A modulated complex lapped transform and its applications to audio processing
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03
Attacks on digital watermarks: classification, estimation based attacks, and benchmarks
IEEE Communications Magazine
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
On reversibility of random binning based data-hiding techniques: security perspectives
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Embedding and Retrieving Private Metadata in Electrocardiograms
Journal of Medical Systems
Cryptanalysis of “wavelet tree quantization” watermarking scheme
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Security evaluation of generalized patchwork algorithm from cryptanalytic viewpoint
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
| Hi-index | 0.00 |
Assume that we are given a watermark (wm) embedding algorithm that performs well against generic benchmark-type attacks that comprise of simple operations that are independent of the algorithm andg enerally of the input as well. A natural question then is to ask for a nearly perfect cryptanalytic attack for the specific watermarking method. In this paper we present and analyze an attack on a state-of-the-art Discrete-Sequence SpreadS pectrum (dsss) audio watermarking algorithm. Our method uses detailed models for watermarked signal and almost always jams or recovers 90% of the watermarking-key. It exploits the host and wm correlations, and the fact that one can locally correct errors in the wm estimates if the watermarking coefficients are discrete. It is natural to use error-correction codes in a watermarking algorithm, and we study the effects of the accompanying redundancy as well.