Conference item
Exploring non-additive distortion in steganography
- Abstract:
- Leading steganography systems make use of the Syndrome-Trellis Code (STC) algorithm to minimize a distortion function while encoding the desired payload, but this constrains the distortion function to be additive. The Gibbs Embedding algorithm works for a certain class of non-additive distortion functions, but has its own limitations and is highly complex. In this short paper we show that it is possible to modify the STC algorithm in a simple way, to minimize a non-additive distortion function suboptimally. We use it for two examples. First, applying it to the S-UNIWARD distortion function, we show that it does indeed reduce distortion, compared with minimizing the additive approximation currently used in image steganography, but that it makes the payload more – not less – detectable. This parallels research attempting to use Gibbs Embedding for the same task. Second, we apply it to distortion defined by the output of a specific detector, as a counter-move in the steganography game. However, unless the Warden is forced to move first (by fixing the detector) this is highly detectable.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 717.4KB, Terms of use)
-
- Publisher copy:
- 10.1145/3206004.3206015
Authors
+ OP VVV Research Center for Informatics
More from this funder
- Grant:
- CZ.02.1.01/0.0/0.0/16_019/0000765
- Publisher:
- Association for Computing Machinery
- Host title:
- IH&MMSec '18 Proceedings of the 6th ACM Workshop on Information Hiding and Multimedia Security
- Journal:
- 6th ACM Workshop on Information Hiding and Multimedia Security More from this journal
- Pages:
- 109-114
- Publication date:
- 2018-06-14
- Acceptance date:
- 2018-03-29
- Event location:
- Innsbruck, Austria
- Event start date:
- 2018-06-20
- Event end date:
- 2018-06-22
- DOI:
- ISBN:
- 9781450356251
- Keywords:
- Pubs id:
-
pubs:844268
- UUID:
-
uuid:ee03a351-669e-46a5-8727-c0e1fab6db89
- Local pid:
-
pubs:844268
- Source identifiers:
-
844268
- Deposit date:
-
2018-04-25
- ARK identifier:
Terms of use
- Copyright holder:
- Pevný and Ker
- Copyright date:
- 2018
- Notes:
- Copyright © 2018 Copyright held by the authors. This is the accepted manuscript version of the article. The final version is available online from Association for Computing Machinery at: https://doi.org/10.1145/3206004.3206015
If you are the owner of this record, you can report an update to it here: Report update to this record