Steganalysis of content-adaptive steganography in spatial domain

88Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Content-adaptive steganography constrains its embedding changes to those parts of covers that are difficult to model, such as textured or noisy regions. When combined with advanced coding techniques, adaptive steganographic methods can embed rather large payloads with low statistical detectability at least when measured using feature-based steganalyzers trained on a given cover source. The recently proposed steganographic algorithm HUGO is an example of this approach. The goal of this paper is to subject this newly proposed algorithm to analysis, identify features capable of detecting payload embedded using such schemes and obtain a better picture regarding the benefit of adaptive steganography with public selection channels. This work describes the technical details of our attack on HUGO as part of the BOSS challenge. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Fridrich, J., Kodovský, J., Holub, V., & Goljan, M. (2011). Steganalysis of content-adaptive steganography in spatial domain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6958 LNCS, pp. 102–117). https://doi.org/10.1007/978-3-642-24178-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free