Detecting IP covert timing channels by correlating packet timing with memory content

R. Stillman
{"title":"Detecting IP covert timing channels by correlating packet timing with memory content","authors":"R. Stillman","doi":"10.1109/SECON.2008.4494286","DOIUrl":null,"url":null,"abstract":"Current covert timing channel detection relies upon discerning the underlying regularity that must be present in the packet interarrival times (PIATs) in order for the channel to carry information. But, it is not hard for a determined adversary to defeat detection. Existing algorithms look only at the PIATs. We hypothesized that detection could be improved by also exploiting knowledge about the system from which the exfiltration is occurring. In particular, the bits that are being extruded likely reside in memory at some point during the transmission. Any correlation between memory content and interpacket time delays-even a remote one-is no coincidence. It suggests an active timing channel. Furthermore, even if the data has been encrypted prior to transmission, at least a portion of the corresponding ciphertext should reside somewhere in the address space used by the rogue process. We tested this approach against an adversary applying increasingly sophisticated schemes to conceal an IP timing channel. Even when the attack escalated well beyond the level at which other detection methods failed, our method identified (and decoded) the covert communication.","PeriodicalId":188817,"journal":{"name":"IEEE SoutheastCon 2008","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE SoutheastCon 2008","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2008.4494286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

Current covert timing channel detection relies upon discerning the underlying regularity that must be present in the packet interarrival times (PIATs) in order for the channel to carry information. But, it is not hard for a determined adversary to defeat detection. Existing algorithms look only at the PIATs. We hypothesized that detection could be improved by also exploiting knowledge about the system from which the exfiltration is occurring. In particular, the bits that are being extruded likely reside in memory at some point during the transmission. Any correlation between memory content and interpacket time delays-even a remote one-is no coincidence. It suggests an active timing channel. Furthermore, even if the data has been encrypted prior to transmission, at least a portion of the corresponding ciphertext should reside somewhere in the address space used by the rogue process. We tested this approach against an adversary applying increasingly sophisticated schemes to conceal an IP timing channel. Even when the attack escalated well beyond the level at which other detection methods failed, our method identified (and decoded) the covert communication.
通过将数据包定时与内存内容相关联来检测IP隐蔽定时通道
当前的隐蔽定时通道检测依赖于识别底层的规则,这些规则必须存在于数据包到达间隔时间(piat)中,以便通道携带信息。但是,对于一个意志坚定的对手来说,打败侦测并不难。现有的算法只关注piat。我们假设,检测也可以通过利用有关系统的知识来改进,从泄漏发生。特别是,被挤出的比特可能在传输过程中的某个时刻驻留在内存中。内存内容和包间时间延迟之间的任何相关性(即使是远程的)都不是巧合。这表明有一个活跃的定时通道。此外,即使数据在传输之前已经加密,至少一部分对应的密文应该驻留在流氓进程使用的地址空间的某个地方。我们对这种方法进行了测试,以对抗对手应用越来越复杂的方案来隐藏IP定时通道。即使攻击升级到其他检测方法无法达到的程度,我们的方法也能识别(并解码)秘密通信。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信