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.
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
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
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999) · Proceedings of the IEEE · doi:10.1109/5.771065 · Cited by 2,546
Chen, B., & Wornell, G. W. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923725 · Cited by 2,095
Multimedia watermarking techniques
Hartung, F., & Kutter, M. (1999) · Proceedings of the IEEE · doi:10.1109/5.771066 · Cited by 1,363
Collusion-secure fingerprinting for digital data
Boneh, D., & Shaw, J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705568 · Cited by 980
Multimedia data-embedding and watermarking technologies
Swanson, M. D., Kobayashi, M., & Tewfik, A. H. (1998) · Proceedings of the IEEE · doi:10.1109/5.687830 · Cited by 924
CODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
Information and information stability of random variables and processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90319-9 · Cited by 758
Watermarking of uncompressed and compressed video
Hartung, F., & Girod, B. (1998) · Signal Processing · doi:10.1016/s0165-1684(98)00011-5 · Cited by 714
An Information-Theoretic Model for Steganography
Cachin, C. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_21 · Cited by 677
Perceptual watermarks for digital images and video
Wolfgang, R. B., Podilchuk, C. I., & Delp, E. J. (1999) · Proceedings of the IEEE · doi:10.1109/5.771067 · Cited by 636
A coding theorem for the discrete memoryless broadcast channel
Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056046 · Cited by 607
Spread spectrum image steganography
Marvel, L. M., Boncelet, C. G., & Retter, C. T. (1999) · IEEE Transactions on Image Processing · doi:10.1109/83.777088 · Cited by 605
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
Reliable communication under channel uncertainty
Lapidoth, A., & Narayan, P. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720535 · Cited by 519
Cryptography in theory and practice
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_12 · Cited by 513
Bender, W. R., Gruhl, D., & Morimoto, N. (1995) · SPIE Proceedings · doi:10.1117/12.205315 · Cited by 507
Information and Information Stability of Random Variables and Processes.
Brillinger, D. R., Pinsker, M. S., & Feinstein, A. (1964) · Applied Statistics · doi:10.2307/2985711 · Cited by 378
A public key watermark for image verification and authentication
Wong, P. W. (2002) · Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269) · doi:10.1109/icip.1998.723526 · Cited by 344
Cryptology for digital TV broadcasting
Macq, B. M., & Quisquater, J.-J. (1995) · Proceedings of the IEEE · doi:10.1109/5.387094 · Cited by 340
Collusion-Secure Fingerprinting for Digital Data
Boneh, D., & Shaw, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_36 · Cited by 289
Berger, T. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056943 · Cited by 206
Statistical analysis of watermarking schemes for copyright protection of images
Hernandez, J. R., & Perez-Gonzalez, F. (1999) · Proceedings of the IEEE · doi:10.1109/5.771069 · Cited by 175
Digital watermarking: from concepts to real-time video applications
Busch, C., Funk, W., & Wolthusen, S. D. B. (1999) · IEEE Computer Graphics and Applications · doi:10.1109/38.736466 · Cited by 111
Identification in the presence of side information with application to watermarking
Steinberg, Y., & Merhav, N. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923724 · Cited by 93
An information-theoretic approach to the design of robust digital watermarking systems
Chen, B., & Wornell, G. W. (1999) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1999.758336 · Cited by 92
On the duality between distributed source coding and data hiding
Chou, J. C., Pradhan, S. S., & Ramchandran, K. (2003) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.1999.832000 · Cited by 89
Information theoretic analysis of steganography
O’Sullivan, J. A., Moulin, P., & Ettinger, J. M. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1998.708902 · Cited by 72
Self-citationPreprocessed and postprocessed quantization index modulation methods for digital watermarking
Chen, B., & Wornell, G. W. (2000) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.384995 · Cited by 61
The Parallel-Gaussian Watermarking Game
Moulin, P., & Mihcak, M. K. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.822578 · Cited by 53
Self-citationReliable broadcast in a computational hybrid model with Byzantine faults, crashes, and recoveries
Michael Backes, A., & Cachin, C. (2004) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2003.1209914 · Cited by 51
Robust optimization solution to the data hiding problem using distributed source coding principles
Chou, J. C., Pradhan, S. S., Ghaoui, L. E., et al. (2000) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.382959 · Cited by 30
Barron, R. J., Chen, B., & Wornell, G. W. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2001.936163 · Cited by 19
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
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.