The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
An information-theoretic model for steganography
Open accessOverview
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
(1979) · Cited by 43,841
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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 5×
“A stegosystem is required to provide perfect secrecy for the embedded message in sense of Shannon, and an encoder constraint is imposed in terms of a distortion measure between covertext and stegotext.”
BackgroundInfluentialA universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Stastical Decision Theory and Bayesian Analysis.
Ghosh, M., & Berger, J. (1988) · Journal of the American Statistical Association · doi:10.2307/2288950 · Cited by 2,905
Bender, W., Gruhl, D., Morimoto, N., & Lu, A. (1996) · IBM Systems Journal · doi:10.1147/sj.353.0313 · Cited by 2,774
Naor, M., & Shamir, A. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053419 · Cited by 2,306
Cox, I. (2002) · Journal of Electronic Imaging · doi:10.1117/1.1494075 · Cited by 2,289
Elements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,380
On the limits of steganography
Anderson, R. J., & Petitcolas, F. A. P. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668971 · Cited by 1,170
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
Bell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
The Prisoners’ Problem and the Subliminal Channel
Simmons, G. J. (1984) · Advances in Cryptology · doi:10.1007/978-1-4684-4730-9_5 · Cited by 977
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 502
Chor, B., Fiat, A., & Naor, M. (1994) · International Cryptology Conference · Cited by 468
A secure, robust watermark for multimedia
Cox, I. J., Kilian, J., Leighton, T., & Shamoon, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_41 · Cited by 422
Authentication Theory/Coding Theory
Simmons, G. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_32 · Cited by 371
Information hiding terminology: Results of an informal plenary meeting and additional proposals
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_52 · Cited by 228
Authentication theory and hypothesis testing
Maurer, U. M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850674 · Cited by 200
Hopper, N. J., Langford, J., & von Ahn, L. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_6 · Cited by 198
(1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9 · Cited by 168
Modeling the Security of Steganographic Systems
Zöllner, J., Federrath, H., Klimant, H., Pfitzmann, A., Piotraschke, R., Westfeld, A., Wicke, G., & Wolf, G. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_24 · Cited by 165
Interval and recency rank source coding: Two on-line adaptive variable-length schemes
Eliaš, P. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057251 · Cited by 113
An Information-Theoretic Approach to Steganography and Watermarking
Mittelholzer, T. (2000) · Lecture notes in computer science · doi:10.1007/10719724_1 · Cited by 101
Security and Watermarking of Multimedia Contents IV
Wong, P., & Delp, E. J. (2002) · Cited by 84
Universal data compression and repetition times
Willems, F. M. J. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42176 · Cited by 48
A unified and generalized treatment of authentication theory
Maurer, U. M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60922-9_32 · Cited by 42
Cited by
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
Covert Communication Over Noisy Channels: A Resolvability Perspective
Bloch, M. R. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2530089 · Cited by 433
Fundamental Limits of Communication With Low Probability of Detection
Wang, L., Wornell, G. W., & Zheng, L. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2548471 · Cited by 371
A Capacity Result for Batch Steganography
Ker, A. D. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2006.891319 · Cited by 113
Natural language watermarking via morphosyntactic alterations
Meral, H. M., Sankur, B., Sumru Özsoy, A., Güngör, T., & Sevinç, E. (2009) · Computer Speech & Language · doi:10.1016/j.csl.2008.04.001 · Cited by 113
Metadata
- Authors
- Cachin, C.
- Venue
- Information and Computation
- Publisher
- Elsevier BV
- Published
- 2004-07
- Volume
- 192
- Issue
- 1
- Pages
- 41-56
- ISSN
- 0890-5401 (ISSN-L)
- OpenAlex
- W2161439181
- Cited by
- 341
- References
- 30
- FWCI
- 13.25
- Type
- journal article
- Language
- en
- Open access
- bronze
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.