Turning Cost-Based Steganography into Model-Based

Jan Butora, Yassine Yousfi, J. Fridrich
{"title":"Turning Cost-Based Steganography into Model-Based","authors":"Jan Butora, Yassine Yousfi, J. Fridrich","doi":"10.1145/3369412.3395065","DOIUrl":null,"url":null,"abstract":"Abstract Most modern steganographic schemes embed secrets by minimizing the total expected cost of modifications. However, costs are usually computed using heuristics and cannot be directly linked to statistical detectability. Moreover, as previously shown by Ker at al., cost-based schemes fundamentally minimize the wrong quantity that makes them more vulnerable to knowledgeable adversary aware of the embedding change rates. In this paper, we research the possibility to convert cost-based schemes to model-based ones by postulating that there exists payload size for which the change rates derived from costs coincide with change rates derived from some (not necessarily known) model. This allows us to find the steganographic Fisher information for each pixel (DCT coefficient), and embed other payload sizes by minimizing deflection. This rather simple measure indeed brings sometimes quite significant improvements in security especially with respect to steganalysis aware of the selection channel. Steganographic algorithms in both spatial and JPEG domains are studied with feature-based classifiers as well as CNNs.","PeriodicalId":298966,"journal":{"name":"Proceedings of the 2020 ACM Workshop on Information Hiding and Multimedia Security","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 ACM Workshop on Information Hiding and Multimedia Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3369412.3395065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Abstract Most modern steganographic schemes embed secrets by minimizing the total expected cost of modifications. However, costs are usually computed using heuristics and cannot be directly linked to statistical detectability. Moreover, as previously shown by Ker at al., cost-based schemes fundamentally minimize the wrong quantity that makes them more vulnerable to knowledgeable adversary aware of the embedding change rates. In this paper, we research the possibility to convert cost-based schemes to model-based ones by postulating that there exists payload size for which the change rates derived from costs coincide with change rates derived from some (not necessarily known) model. This allows us to find the steganographic Fisher information for each pixel (DCT coefficient), and embed other payload sizes by minimizing deflection. This rather simple measure indeed brings sometimes quite significant improvements in security especially with respect to steganalysis aware of the selection channel. Steganographic algorithms in both spatial and JPEG domains are studied with feature-based classifiers as well as CNNs.
将基于成本的隐写变为基于模型的隐写
大多数现代隐写方案通过最小化修改的总预期成本来嵌入秘密。然而,成本通常是使用启发式计算的,不能直接与统计可检测性联系起来。此外,正如Ker等人先前所显示的那样,基于成本的方案从根本上最小化了错误的数量,这使得它们更容易受到了解嵌入变化率的知识渊博的对手的攻击。在本文中,我们研究了将基于成本的方案转换为基于模型的方案的可能性,假设存在有效载荷大小,其中由成本得出的变化率与从某些(不一定已知的)模型得出的变化率一致。这使我们能够找到每个像素的隐写费雪信息(DCT系数),并通过最小化偏转嵌入其他有效载荷大小。这个相当简单的措施确实有时会带来相当显著的安全性改进,特别是在对选择通道的隐写分析方面。利用基于特征的分类器和cnn对空间和JPEG域的隐写算法进行了研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信