A payload-dependent packet rearranging covert channel for mobile VoIP traffic

被引:40
作者
Liang, Chen [1 ]
Wang, Xianmin [2 ]
Zhang, Xiaosong [1 ]
Zhang, Yu [3 ,4 ,5 ]
Sharif, Kashif [1 ]
Tan, Yu-an [1 ]
机构
[1] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China
[2] Guangzhou Univ, Sch Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[3] Beijing Univ Civil Engn & Architecture, Sch Elect & Informat Engn, Beijing 100044, Peoples R China
[4] Beijing Univ Civil Engn & Architecture, Beijing Key Lab Intelligent Proc Bldg Big Data, Beijing 100044, Peoples R China
[5] China Univ Min & Technol, State Key Lab China GeoMech & Deep Underground En, Beijing 100083, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Covert channel; Mobile VoIP; Packet rearranging; UDP traffics; CONVOLUTIONAL NEURAL-NETWORK; TIMING CHANNELS; SECURE; EFFICIENT;
D O I
10.1016/j.ins.2018.07.011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
VoIP (Voice over Internet Protocol) is one of the most prevalent services for the mobile users. An enormous amount of audio and video data is transmitted over VoIP communication continuously, to make it potentially available for stealth message transfer. The existing covert channel schemes focus on modifying packet payload or inter-packet delays, the former kind is easy to be detected since a minor modification may lead to distinct abnormalities, while the latter is too sensitive to network jitter due to its short inter-packet delays. Hence, to effectively construct covert channel becomes a challenge, and requires investigation in using mobile VoIP traffic for robust and stealthy covert communication. In this paper, we propose a covert channel scheme which communicates by rearranging the packet sending sequences while keeps the undetectability and robustness. Unlike the existed packet rearranging covert channels which may concentrate on packet rearranging according to the existed packet features such as packet id and packet length, the proposed scheme focuses on building packet rearranging covert channel whose function is regardless of the variation on legitimate traffic. According to the hash value of the payload, the packets are classified into delimiter packets and carrier packets, and the covert message is embedded onto a number of carrier packets (NoCP) between the relative delimiter packets. Moreover, to mitigate the interference from channel noise, the differences between two correlative NoCPs are utilized as the codewords by redundantly partitioning their values into 1-bit symbols. The channel parameters are adjustable to trade off between the efficiency and security. The corresponding experiments are conducted over three kinds of typical mobile VoIP traffics to evaluate the undetectability, robustness and throughput of our scheme. Results of the BER (bit error rate) and KS (Kolmogorov-Smirnov) test show that the scheme is robust and stealthy. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:162 / 173
页数:12
相关论文
共 49 条
  • [1] [Anonymous], INF SCI
  • [2] [Anonymous], EUR INT C ATH GREEC
  • [3] [Anonymous], INF SCI
  • [4] [Anonymous], UB INT COMP ADV TRUS
  • [5] [Anonymous], J NETWORK COMPUT APP
  • [6] A comparative analysis of detection metrics for covert timing channels
    Archibald, Rennie
    Ghosar, Dipak
    [J]. COMPUTERS & SECURITY, 2014, 45 : 284 - 292
  • [7] A Survey of Timing Channels and Countermeasures
    Biswas, Arnab Kumar
    Ghosal, Dipak
    Nagaraja, Shishir
    [J]. ACM COMPUTING SURVEYS, 2017, 50 (01)
  • [8] Cabuk S., 2004, P 11 ACM C COMP COMM, P178, DOI DOI 10.1145/1030083.1030108
  • [9] Multimedia quality transmission evaluation over wireless networks: a survey
    Chaari, Hekma
    Mnif, Kais
    Kamoun, Lotfi
    [J]. WIRELESS NETWORKS, 2016, 22 (08) : 2607 - 2621
  • [10] Lattice-based linearly homomorphic signatures in the standard model
    Chen, Wenbin
    Lei, Hao
    Qi, Ke
    [J]. THEORETICAL COMPUTER SCIENCE, 2016, 634 : 47 - 54