Botnet command and control based on Short Message Service and human mobility

被引:13
作者
Hua, Jingyu [1 ]
Sakurai, Kouichi [1 ]
机构
[1] Kyushu Univ, Nishi Ku, Fukuoka 8190395, Japan
关键词
Mobile botnet; Command and control; Short Message Service; Human mobility;
D O I
10.1016/j.comnet.2012.06.007
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Many serious threats for PCs are spreading to the mobile environment. A mobile botnet, which is a collection of hijacked smartphones under the control of hackers, is one of them. With the quick development of the computing and communication abilities of smartphones, many command and control (C&C) techniques in PC botnets can be easily reused in mobile botnets. However, some particular functions and characteristics of smartphones may provide botmasters with additional means to control their mobile botnets. This paper presents two special C&C mechanisms that leverage Short Message Service and human mobility, respectively. The first one designs a SMS-based flooding algorithm to propagate commands. We theoretically prove that the uniform random graph is the optimal topology for this botnet, and demonstrate its high efficiency and stealth with various simulations. The second one utilizes Bluetooth to transmit botnet commands when hijacked smartphones encounter each other while in motion. We study its performance in a 100 m x 100 m square area with NS-2 simulations, and show that human-mobility characteristics facilitate the command propagation. Even if the infection rate is low, the command can still be effectively propagated provided that the mobility of devices is high. In the end, we propose effective defense strategies against these two special C&C mechanisms. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:579 / 597
页数:19
相关论文
共 31 条
[1]  
[Anonymous], 2008, Mobile Malware Attacks and Defense
[2]  
[Anonymous], 2007, Random Graph Dynamics
[3]  
[Anonymous], MOB UB SYST NETW SER
[4]  
[Anonymous], 2003, Internet Mathematics
[5]  
Apvrille A., 2010, P 19 ANN EICAR C FRA
[6]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]   'Black hats' set their sights on mobile phone networks [J].
Campbell, MacGregor .
NEW SCIENTIST, 2009, 204 (2734) :26-26
[8]  
Csardi G., 2006, IGRAPH LIB
[9]  
Davis CR, 2008, LECT NOTES COMPUT SC, V5283, P461
[10]  
Erdos P., 1959, PUBL MATH-DEBRECEN, V6, P290, DOI DOI 10.5486/PMD.1959.6.3-4.12