Time Lord: Covert Timing Channel Implementation and Realistic Experimentation

E. J. Castillo, X. Mountrouidou, Xiangyang Li
{"title":"Time Lord: Covert Timing Channel Implementation and Realistic Experimentation","authors":"E. J. Castillo, X. Mountrouidou, Xiangyang Li","doi":"10.1145/3017680.3022463","DOIUrl":null,"url":null,"abstract":"Covert channels are unique methods for exchanging messages, since they permit sending information secretly. Unlike encryption, covert communication allows to send information covertly, using an otherwise legitimate medium of transfer, thus it is not apparent that a message is being transferred at all. There is limited research on Covert Timing Channels (CTCs), i.e., channels that manipulate packet inter-arrival time to exchange messages based on a certain encoding. Implementing and testing CTCs in real network environments is lacking in the current literature due to sensitivity to network delays that significantly affects this type of communication. Thus, it is important to implement CTC communication to analyze the challenges of creating robust, efficient, and undetectable channels in real life situations. It is also paramount to test these implementations in a wide range of realistic network conditions. In this research, we have developed and tested two implementations of CTCs. The first implementation is based on [1] using standard bits encoding and ASCII for simplicity and robustness. This implementation suffers from easy detection. On the other hand, we developed the second implementation with goal to make the channel undetectable by using encoding with five different delays, i.e., symbols, where five symbols in a specific order correspond to one letter of the alphabet. This implementation has sufficient randomness to be undetected with standard statistical mechanisms. We have tested both implementations on local networks, the Global Environment for Network Innovations (GENI) controlled environment, networks across states in the US, and internationally.","PeriodicalId":344382,"journal":{"name":"Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3017680.3022463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Covert channels are unique methods for exchanging messages, since they permit sending information secretly. Unlike encryption, covert communication allows to send information covertly, using an otherwise legitimate medium of transfer, thus it is not apparent that a message is being transferred at all. There is limited research on Covert Timing Channels (CTCs), i.e., channels that manipulate packet inter-arrival time to exchange messages based on a certain encoding. Implementing and testing CTCs in real network environments is lacking in the current literature due to sensitivity to network delays that significantly affects this type of communication. Thus, it is important to implement CTC communication to analyze the challenges of creating robust, efficient, and undetectable channels in real life situations. It is also paramount to test these implementations in a wide range of realistic network conditions. In this research, we have developed and tested two implementations of CTCs. The first implementation is based on [1] using standard bits encoding and ASCII for simplicity and robustness. This implementation suffers from easy detection. On the other hand, we developed the second implementation with goal to make the channel undetectable by using encoding with five different delays, i.e., symbols, where five symbols in a specific order correspond to one letter of the alphabet. This implementation has sufficient randomness to be undetected with standard statistical mechanisms. We have tested both implementations on local networks, the Global Environment for Network Innovations (GENI) controlled environment, networks across states in the US, and internationally.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时间领主:隐蔽时间通道的实现和现实实验
隐蔽通道是交换信息的独特方法,因为它们允许秘密发送信息。与加密不同,隐蔽通信允许秘密地发送信息,使用其他合法的传输媒介,因此根本不明显正在传输消息。隐蔽定时信道(ctc),即根据一定的编码操作数据包间到达时间来交换消息的信道,目前研究有限。由于对网络延迟的敏感性,当前文献缺乏在真实网络环境中实现和测试ctc,网络延迟会严重影响这种类型的通信。因此,实现CTC通信来分析在现实生活中创建健壮、高效和不可检测的信道的挑战是很重要的。在广泛的实际网络条件下测试这些实现也是至关重要的。在本研究中,我们开发并测试了ctc的两种实现。第一个实现基于[1],使用标准位编码和ASCII,以实现简单性和健壮性。这种实现容易被发现。另一方面,我们开发了第二个实现,其目标是通过使用具有五种不同延迟的编码来使信道不可检测,即符号,其中五个符号以特定顺序对应字母表中的一个字母。这种实现具有足够的随机性,无法用标准统计机制检测到。我们已经在本地网络、全球网络创新环境(GENI)控制环境、美国各州的网络和国际上测试了这两种实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Handling Very Large Lecture Courses: Keeping the Wheels on the Bus III (Abstract Only) CS1: Computation & Cognition -- An Evidence-Based Course to Broaden Participation (Abstract Only) Lessons Learned in the Design and Delivery of an Introductory Programming MOOC Micro Projects: Putting Light and Magic into Learning Computer Systems Concepts (Abstract Only) Building Evaluative Capacity for Out of School Organizations that Engage Girls in Computer Science (Abstract Only)
×
引用
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