分组速率隐蔽时序信道建模

P. Shrestha, M. Hempel, M. Alahmad, H. Sharif
{"title":"分组速率隐蔽时序信道建模","authors":"P. Shrestha, M. Hempel, M. Alahmad, H. Sharif","doi":"10.1109/INNOVATIONS.2013.6544393","DOIUrl":null,"url":null,"abstract":"Covert channels provide a medium for secret communication by exploiting caveats in common networking protocols to hide information exchanges within benign activities, without being detected by unsuspecting hosts and network firewalls. This makes covert channels a significant security concern. Therefore, it is of utmost importance to develop effective and comprehensive countermeasures. In general, the more secret data capacity a covert channel provides the higher its estimated threat level is, as it diminishes the time available to detect and disrupt such activities and prevent the information exchange. Hence, determining the capacity of a covert channel is important. However, most work in capacity estimation is specifically targeted at individual algorithms only, and thus is similarly in applicability. A general mathematical model that can predict the capacity of most algorithms is a key research need for effective covert channel prevention. In this paper, we have provided a general analytical model to determine the capacity of timing-based covert channels, and verified the model with computer simulations.","PeriodicalId":438270,"journal":{"name":"2013 9th International Conference on Innovations in Information Technology (IIT)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Modeling packet rate covert timing channels\",\"authors\":\"P. Shrestha, M. Hempel, M. Alahmad, H. Sharif\",\"doi\":\"10.1109/INNOVATIONS.2013.6544393\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Covert channels provide a medium for secret communication by exploiting caveats in common networking protocols to hide information exchanges within benign activities, without being detected by unsuspecting hosts and network firewalls. This makes covert channels a significant security concern. Therefore, it is of utmost importance to develop effective and comprehensive countermeasures. In general, the more secret data capacity a covert channel provides the higher its estimated threat level is, as it diminishes the time available to detect and disrupt such activities and prevent the information exchange. Hence, determining the capacity of a covert channel is important. However, most work in capacity estimation is specifically targeted at individual algorithms only, and thus is similarly in applicability. A general mathematical model that can predict the capacity of most algorithms is a key research need for effective covert channel prevention. In this paper, we have provided a general analytical model to determine the capacity of timing-based covert channels, and verified the model with computer simulations.\",\"PeriodicalId\":438270,\"journal\":{\"name\":\"2013 9th International Conference on Innovations in Information Technology (IIT)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 9th International Conference on Innovations in Information Technology (IIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INNOVATIONS.2013.6544393\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 9th International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INNOVATIONS.2013.6544393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

隐蔽通道通过利用普通网络协议中的警告,将信息交换隐藏在良性活动中,而不会被毫无戒心的主机和网络防火墙检测到,从而为秘密通信提供了一种媒介。这使得隐蔽通道成为一个重要的安全问题。因此,制定有效而全面的对策至关重要。一般来说,隐蔽通道提供的秘密数据容量越多,其估计的威胁级别就越高,因为它减少了检测和破坏此类活动并阻止信息交换的可用时间。因此,确定隐蔽信道的容量非常重要。然而,容量估计中的大多数工作都是专门针对单个算法的,因此在适用性方面也类似。一个能够预测大多数算法容量的通用数学模型是有效预防隐蔽信道的关键研究需求。在本文中,我们提供了一个通用的分析模型来确定基于时序的隐蔽信道的容量,并通过计算机仿真验证了该模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modeling packet rate covert timing channels
Covert channels provide a medium for secret communication by exploiting caveats in common networking protocols to hide information exchanges within benign activities, without being detected by unsuspecting hosts and network firewalls. This makes covert channels a significant security concern. Therefore, it is of utmost importance to develop effective and comprehensive countermeasures. In general, the more secret data capacity a covert channel provides the higher its estimated threat level is, as it diminishes the time available to detect and disrupt such activities and prevent the information exchange. Hence, determining the capacity of a covert channel is important. However, most work in capacity estimation is specifically targeted at individual algorithms only, and thus is similarly in applicability. A general mathematical model that can predict the capacity of most algorithms is a key research need for effective covert channel prevention. In this paper, we have provided a general analytical model to determine the capacity of timing-based covert channels, and verified the model with computer simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信