On Viable Statistical Metrics for Re-Embedding Network Steganalysis

Jun O. Seo, S. Manoharan, U. Speidel
{"title":"On Viable Statistical Metrics for Re-Embedding Network Steganalysis","authors":"Jun O. Seo, S. Manoharan, U. Speidel","doi":"10.1109/ITNAC55475.2022.9998399","DOIUrl":null,"url":null,"abstract":"Network steganalyses attempt to uncover hidden messages (steganograms) in network flows. These techniques are binary in that they classify if a flow contains steganograms or not. Moreover, most of these techniques assume the availability flows that do not contain any steganograms as baselines for comparison, an assumption that is hard to hold. A re-embedding steganalysis does not require any baseline, and moreover, it can not only detect the presence of steganograms but also estimate the amount of steganograms. Being able to estimate the amount of steganograms allows a network forensic expert to judge the damage caused by these hidden messages. This paper addresses the question of what statistical metrics might apply for effective re-embedding steganalysis of network traces. It presents an empirical comparison of several statistical metrics in the light of their effectiveness in re-embedding steganalysis.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNAC55475.2022.9998399","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Network steganalyses attempt to uncover hidden messages (steganograms) in network flows. These techniques are binary in that they classify if a flow contains steganograms or not. Moreover, most of these techniques assume the availability flows that do not contain any steganograms as baselines for comparison, an assumption that is hard to hold. A re-embedding steganalysis does not require any baseline, and moreover, it can not only detect the presence of steganograms but also estimate the amount of steganograms. Being able to estimate the amount of steganograms allows a network forensic expert to judge the damage caused by these hidden messages. This paper addresses the question of what statistical metrics might apply for effective re-embedding steganalysis of network traces. It presents an empirical comparison of several statistical metrics in the light of their effectiveness in re-embedding steganalysis.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
重新嵌入网络隐写分析的可行统计度量
网络隐写分析试图揭示网络流中隐藏的消息(隐写图)。这些技术是二元的,因为它们对流是否包含隐写进行分类。此外,这些技术中的大多数都假设不包含任何隐写图的可用性流作为比较的基线,这是一个很难成立的假设。重新嵌入隐写分析不需要任何基线,而且它不仅可以检测出隐写的存在,而且可以估计出隐写的数量。能够估计隐写图的数量使网络法医专家能够判断这些隐藏信息造成的损害。本文解决了哪些统计度量可能适用于网络痕迹的有效重嵌入隐写分析的问题。它提出了几个统计指标的实证比较,在他们的有效性在重新嵌入隐写分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Channel Sounding Measurements for 5G Campus Networks in Industrial Environments Implementation and Experimental Evaluation of the Rebalancing Algorithm for Folded Clos Networks Architectural Implementation of AES based 5G Security Protocol on FPGA Attribute Verifier for Internet of Things Artificial Neural Network (ANN)-Aided Signal Demodulation in a SiPM-Based VLC System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1