The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Watermarking security: theory and practice
Abstract
This paper proposes a theory of watermarking security based on a cryptanalysis point of view. The main idea is that information about the secret key leaks from the observations, for instance, watermarked pieces of content, available to the opponent. Tools from information theory (Shannon's mutual information and Fisher's information matrix) can measure this leakage of information. The security level is then defined as the number of observations the attacker needs to successfully estimate the secret key. This theory is applied to two common watermarking methods: the substitutive scheme and the spread spectrum-based techniques. Their security levels are calculated against three kinds of attack. The experimental work illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels derived in the theoretical part of the paper.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“Data are written in small letters, and random variables in capital ones.”
BackgroundIndependent component analysis: algorithms and applications
Hyvärinen, A., & Oja, E. (2000) · Neural Networks · doi:10.1016/s0893-6080(00)00026-5 · Cited by 8,705
Independent component analysis, A new concept?
Comon, P. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90029-9 · Cited by 8,205
Fast and robust fixed-point algorithms for independent component analysis
Hyvarinen, A. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.761722 · Cited by 6,246
Chen, B., & Wornell, G. W. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923725 · Cited by 2,095
Blind signal separation: statistical principles
Cardoso, J.-F. (1998) · Proceedings of the IEEE · doi:10.1109/5.720250 · Cited by 1,885
Watermarking as communications with side information
Cox, I. J., Miller, M. L., & McKellips, A. L. (1999) · Proceedings of the IEEE · doi:10.1109/5.771068 · Cited by 522
Blind separation of instantaneous mixtures of nonstationary sources
Pham, D.-T., & Cardoso, J.-F. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.942614 · Cited by 516
Improved spread spectrum: a new modulation technique for robust watermarking
Malvar, H. S., & Florencio, D. A. F. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.809385 · Cited by 487
Cited by
An Overview of Digital Video Watermarking
Asikuzzaman, M., & Pickering, M. R. (2018) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2017.2712162 · Cited by 294
Artificial Fingerprinting for Generative Models: Rooting Deepfake Attribution in Training Data
Yu, N., Skripniuk, V., Abdelnabi, S., & Fritz, M. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.01418 · Cited by 195
Perceptual image hashing based on virtual watermark detection
Khelifi, F., & Jiang, J. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2038637 · Cited by 107
An efficient security system for CABAC bin-strings of H.264/SVC
Asghar, M. N., & Ghanbari, M. (2013) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2204941 · Cited by 38
Information Forensics and Security: A quarter-century-long journey
Barni, M., Campisi, P., Delp, E. J., Doërr, G., Fridrich, J., Memon, N., Pérez-González, F., Rocha, A., Verdoliva, L., & Wu, M. (2023) · IEEE Signal Processing Magazine · doi:10.1109/msp.2023.3275319 · Cited by 28
Metadata
- Authors
- Cayre, F., Fontaine, C., & Furon, T.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2005-10
- Volume
- 53
- Issue
- 10
- Pages
- 3976-3987
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2149074144
- Cited by
- 300
- References
- 23
- FWCI
- 15.56
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Watermarking security: theory and practice. https://app.cochat.ai/papers/10.1109/tsp.2005.855418
- The paper
- Cayre, F., Fontaine, C., & Furon, T. (2005). Watermarking security: theory and practice. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2005.855418
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.