Web Covert Timing Channels Detection based on Entropy

Mehrdad Nasseralfoghara, Hamid-Reza Hamidi
{"title":"Web Covert Timing Channels Detection based on Entropy","authors":"Mehrdad Nasseralfoghara, Hamid-Reza Hamidi","doi":"10.1109/ICWR.2019.8765291","DOIUrl":null,"url":null,"abstract":"Todays analyzing web weaknesses and vulnerabilities in order to find security attacks has become more urgent. In case there is a communication contrary to the system security policies, a covert channel has been created. The attacker can easily disclosure information from the victim’s system with just one public access permission. Covert timing channels, unlike covert storage channels, do not have memory storage and they draw less attention. Different methods have been proposed for their identification, which generally benefit from the shape of traffic and the channel’s regularity. In this article, an entropy-based detection method is designed and implemented. The attacker can adjust the amount of channel entropy by controlling measures such as changing the channel’s level or creating noise on the channel to protect from the analyst’s detection. As a result, the entropy threshold is not always constant for detection. By comparing the entropy from different levels of the channel and the analyst, we conclude that the analyst must investigate traffic at all possible levels.","PeriodicalId":6680,"journal":{"name":"2019 5th International Conference on Web Research (ICWR)","volume":"5 1","pages":"12-15"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 5th International Conference on Web Research (ICWR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWR.2019.8765291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Todays analyzing web weaknesses and vulnerabilities in order to find security attacks has become more urgent. In case there is a communication contrary to the system security policies, a covert channel has been created. The attacker can easily disclosure information from the victim’s system with just one public access permission. Covert timing channels, unlike covert storage channels, do not have memory storage and they draw less attention. Different methods have been proposed for their identification, which generally benefit from the shape of traffic and the channel’s regularity. In this article, an entropy-based detection method is designed and implemented. The attacker can adjust the amount of channel entropy by controlling measures such as changing the channel’s level or creating noise on the channel to protect from the analyst’s detection. As a result, the entropy threshold is not always constant for detection. By comparing the entropy from different levels of the channel and the analyst, we conclude that the analyst must investigate traffic at all possible levels.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于熵的Web隐蔽时序通道检测
如今,分析web弱点和漏洞以发现安全攻击变得更加紧迫。如果存在违反系统安全策略的通信,则创建了隐蔽通道。攻击者只需一个公共访问权限就可以轻松地从受害者的系统中泄露信息。隐蔽时序通道与隐蔽存储通道不同,它没有内存存储,因而较少引起人们的注意。人们提出了不同的方法来识别它们,这些方法通常受益于交通的形状和信道的规律性。本文设计并实现了一种基于熵的检测方法。攻击者可以通过控制诸如改变信道电平或在信道上制造噪声等措施来调整信道熵的数量,以防止分析者的检测。因此,对于检测来说,熵阈值并不总是恒定的。通过比较来自不同层次的信道和分析的熵,我们得出结论,分析必须在所有可能的层次上调查流量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Anomaly-Based IDS for Detecting Attacks in RPL-Based Internet of Things A Sentiment Aggregation System based on an OWA Operator Using Web Mining in the Analysis of Housing Prices: A Case study of Tehran An Adaptive Machine Learning Based Approach for Phishing Detection Using Hybrid Features Mobility-Aware Parent Selection for Routing Protocol in Wireless Sensor Networks using RPL
×
引用
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