IEEE International Conference on Acoustics Speech and Signal Processing 2002
DOI: 10.1109/icassp.2002.5745046
|View full text |Cite
|
Sign up to set email alerts
|

Secure watermark detection with nonparametric decision boundaries

Abstract: In this paper we will,address the problem of constructing a nonparameteric decision boundary for watermark detection. Most curre nt watermarking algorithms have a parametric decision boundary that can be undone if the pirate has unlimited access to the detector. In this work we propose a fractal decision boundary which can not be estimated. That boundary is obtained by processing the decision boundary corresponding to the underlying watermarking algorithm. The performance of the new technique is essenti ally s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2003
2003
2007
2007

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…In the same paper, the authors recommend processing of the detection boundary to make it fractal-like. This is addressed in another paper by the same authors [5]. According to [5], this new boundary cannot be reliably estimated because it is nonparametric.…”
Section: Introductionmentioning
confidence: 98%
See 3 more Smart Citations
“…In the same paper, the authors recommend processing of the detection boundary to make it fractal-like. This is addressed in another paper by the same authors [5]. According to [5], this new boundary cannot be reliably estimated because it is nonparametric.…”
Section: Introductionmentioning
confidence: 98%
“…Finally, the detection coefficients, t(s, w) and t(ŝ, w) (see (5)), corresponding to the original unwatermarked signal s and the estimated signalŝ are denoted by d s and dŝ, respectively. The algorithm of Section IV-B was modified as described in Section VII and used to attack these images.…”
Section: B Correlation Detectormentioning
confidence: 99%
See 2 more Smart Citations
“…If, at the detection, linear correlation is replaced by a quadratic one, more generally by a quadratic form, it is shown in [4] that the most favorable case of such an attack has O(N 2 ) computational complexity. In [11], a decision boundary with a fractal dimension has been exploited to obtain security. Here we are interested in a communication model for the oracle attack in the integrity watermarking case.…”
Section: Introductionmentioning
confidence: 99%