The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Hide and seek: an introduction to steganography
Abstract
Although people have hidden secrets in plain sight-now called steganography-throughout the ages, the recent growth in computational power and technology has propelled it to the forefront of today's security techniques. Essentially, the information-hiding process in a steganographic system starts by identifying a cover medium's redundant bits (those that can be modified without destroying that medium's integrity). The embedding process creates a stego medium by replacing these redundant bits with data from the hidden message. This article discusses existing steganographic systems and presents recent research in detecting them via statistical steganalysis. Here, we present recent research and discuss the practical application of detection algorithms and the mechanisms for getting around them.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Detection, Estimation, and Modulation Theory, Part I
Van Trees, H. L. (2001) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471221082 · Cited by 3,891
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
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
Exploring steganography: Seeing the unseen
Johnson, N. F., & Jajodia, S. (1998) · Computer · doi:10.1109/mc.1998.4655281 · Cited by 1,485
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
Attacks on Steganographic Systems
Westfeld, A., & Pfitzmann, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10719724_5 · Cited by 934
Description of a new variable-length key, 64-bit block cipher (Blowfish)
Schneier, B. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58108-1_24 · Cited by 791
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
van Lint, J. H. (1982) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-07998-0 · Cited by 668
Defending against statistical steganalysis
Provos, N. (2001) · Cited by 575
Self-citationDetecting Hidden Messages Using Higher-Order Statistics and Support Vector Machines
Lyu, S., & Farid, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36415-3_22 · Cited by 450
Foiling the cracker: A survey of, and improvements to, password security
Klein, D. V. (1992) · Cited by 349
Steganalysis of Images Created Using Current Steganography Software
Johnson, N. F., & Jajodia, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_19 · Cited by 338
The base-rate fallacy and its implications for the difficulty of intrusion detection
Axelsson, S. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319710 · Cited by 325
Detecting hidden messages using higher-order statistical models
Farid, H. (2003) · Proceedings. International Conference on Image Processing · doi:10.1109/icip.2002.1040098 · Cited by 268
Detecting Steganographic Content on the Internet
Provos, N., & Honeyman, P. (2002) · Deep Blue (University of Michigan) · Cited by 251
Self-citationProbability models for clutter in natural images
Grenander, U., & Srivastava, A. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.917579 · Cited by 126
An Information-Theoretic Model for Steganography.
Cachin, C. (2000) · Cited by 11
Cited by
Digital image steganography: Survey and analysis of current methods
Cheddad, A., Condell, J., Curran, K., & Mc Kevitt, P. (2010) · Signal Processing · doi:10.1016/j.sigpro.2009.08.010 · Cited by 1,704
Comprehensive survey of image steganography: Techniques, Evaluations, and trends in future research
Kadhim, I. J., Premaratne, P., Vial, P. J., & Halloran, B. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.06.075 · Cited by 452
Baluja, S. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2901877 · Cited by 325
Quantity implicatures, exhaustive interpretation, and rational conversation
Franke, M. (2011) · Semantics and Pragmatics · doi:10.3765/sp.4.1 · Cited by 319
Genome sequence of Haloarcula marismortui: A halophilic archaeon from the Dead Sea
Baliga, N. S., Bonneau, R., Facciotti, M. T., Pan, M., Glusman, G., Deutsch, E. W., Shannon, P., Chiu, Y., Weng, R. S., Gan, R. R., et al. (2004) · Genome Research · doi:10.1101/gr.2700304 · Cited by 302
Metadata
- Authors
- Provos, N., & Honeyman, P.
- Venue
- IEEE Security & Privacy
- Published
- 2003-05
- Volume
- 1
- Issue
- 3
- Pages
- 32-44
- ISSN
- 1540-7993 (ISSN-L)
- 1558-4046
- OpenAlex
- W2103228545
- Cited by
- 1,292
- References
- 20
- FWCI
- 17.48
- 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.