The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Information-theoretic analysis of information hiding
Abstract
An information-theoretic analysis of information hiding is presented, forming the theoretical basis for design of information-hiding systems. Information hiding is an emerging research area which encompasses applications such as copyright protection for digital media, watermarking, fingerprinting, steganography, and data embedding. In these applications, information is hidden within a host data set and is to be reliably communicated to a receiver. The host data set is intentionally corrupted, but in a covert way, designed to be imperceptible to a casual analysis. Next, an attacker may seek to destroy this hidden information, and for this purpose, introduce additional distortion to the data set. Side information (in the form of cryptographic keys and/or information about the host signal) may be available to the information hider and to the decoder. We formalize these notions and evaluate the hiding capacity, which upper-bounds the rates of reliable transmission and quantifies the fundamental tradeoff between three quantities: the achievable information-hiding rates and the allowed distortion levels for the information hider and the attacker. The hiding capacity is the value of a game between the information hider and the attacker. The optimal attack strategy is the solution of a particular rate-distortion problem, and the optimal hiding strategy is the solution to a channel-coding problem. The hiding capacity is derived by extending the Gel'fand-Pinsker (1980) theory of communication with side information at the encoder. The extensions include the presence of distortion constraints, side information at the decoder, and unknown communication channel. Explicit formulas for capacity are given in several cases, including Bernoulli and Gaussian problems, as well as the important special case of small distortions. In some cases, including the last two above, the hiding capacity is the same whether or not the decoder knows the host data set. It is shown that many existing information-hiding systems in the literature operate far below capacity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
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
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Dynamic Noncooperative Game Theory
(1982) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6169-7 · Cited by 4,057
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
The rate-distortion function for source coding with side information at the decoder
Wyner, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055508 · Cited by 3,023
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
Cited by
Chen, B., & Wornell, G. W. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923725 · Cited by 2,095
Digital Watermarking and Steganography
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-372585-1.x5001-3 · Cited by 1,656
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Digital watermarking: algorithms and applications
Podilchuk, C. I., & Delp, E. J. (2001) · IEEE Signal Processing Magazine · doi:10.1109/79.939835 · Cited by 746
Steganography in digital media: principles, algorithms, and applications
(2010) · Choice Reviews Online · doi:10.5860/choice.47-6907 · Cited by 546
Information Forensics: An Overview of the First Decade
Stamm, M. C., Wu, M., & Liu, K. J. R. (2013) · IEEE Access · doi:10.1109/access.2013.2260814 · Cited by 394
Anti-collusion fingerprinting for multimedia
Trappe, W., Wu, M., Wang, Z. J., & Liu, K. J. R. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.809378 · Cited by 382
Hierarchical watermarking for secure image authentication with localization
Utku Celik, M., Sharma, G., Saber, E., & Murat Tekalp, A. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.1014990 · Cited by 368
The First 50 Years of Electronic Watermarking
Cox, I. J., & Miller, M. L. (2002) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/s1110865702000525 · Cited by 360
Scalar costa scheme for information embedding
Eggers, J. J., Bauml, R., Tzschoppe, R., & Girod, B. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.809366 · Cited by 357
Attacks on digital watermarks: classification, estimation based attacks, and benchmarks
Voloshynovskiy, S., Pereira, S., Pun, T., Eggers, J. J., & Su, J. K. (2001) · IEEE Communications Magazine · doi:10.1109/35.940053 · Cited by 336
A close-to-capacity dirty paper coding scheme
Erez, U., & ten Brink, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855586 · Cited by 307
Moulin, P., & Koetter, R. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.859599 · Cited by 306
Self-citationSecure space-time communication
Hero, A. O. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820010 · Cited by 294
Chen, B., & Wornell, G. W. (2002) · 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) · doi:10.1109/isit.2000.866336 · Cited by 114
Metadata
- Authors
- Moulin, P., & O'Sullivan, J. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-03
- Volume
- 49
- Issue
- 3
- Pages
- 563-593
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2167577564
- Cited by
- 673
- References
- 42
- FWCI
- 70.66
- 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
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.