Botnet Topology Reconstruction: A Case Study

Over the past decade, bot net has been a serious threat to the Internet because it can be used to launch a variety of attacks on the Internet. To prevent the attacks, we have to fully understand the infection paths and attack methods of bot net. Hence, this study is aimed at reconstructing scenarios of attacks performed by bot net on the Testbed@TWISC platform in such a way that the behavior of the bot net and the infection period can be observed and analyzed so that better defense tools can be built.

[1]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[2]  Malvin Carl Teich,et al.  Power-law shot noise , 1990, IEEE Trans. Inf. Theory.

[3]  Udi Manber,et al.  A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING , 1999 .

[4]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Calton Pu,et al.  Evolutionary study of phishing , 2008, 2008 eCrime Researchers Summit.

[6]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[7]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[8]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[9]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[10]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[11]  Olfa Nasraoui,et al.  Web data mining: exploring hyperlinks, contents, and usage data , 2008, SKDD.

[12]  Wolfgang Banzhaf,et al.  The use of computational intelligence in intrusion detection systems: A review , 2010, Appl. Soft Comput..

[13]  Shahram Rahimi,et al.  Soft computing in intrusion detection: the state of the art , 2010, J. Ambient Intell. Humaniz. Comput..

[14]  C. Borgs,et al.  Percolation on dense graph sequences. , 2007, math/0701346.

[15]  Yan Chen,et al.  Botnet Research Survey , 2008, 2008 32nd Annual IEEE International Computer Software and Applications Conference.

[16]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[17]  Abhinav Srivastava,et al.  Evaluating email’s feasibility for botnet command and control , 2008, 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN).

[18]  Haining Wang,et al.  Anti-Phishing in Offense and Defense , 2008, 2008 Annual Computer Security Applications Conference (ACSAC).

[19]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[20]  Survey on Malware Detection Methods , 2009 .

[21]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[22]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[23]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[24]  Daryl J. Daley,et al.  An Introduction to the Theory of Point Processes , 2013 .

[25]  A. Baddeley.  Spatial sampling and censoring , 2019, Stochastic Geometry.

[26]  M. Haenggi,et al.  Interference in Large Wireless Networks , 2009, Found. Trends Netw..

[27]  Joohan Lee,et al.  A survey of data mining techniques for malware detection using file features , 2008, ACM-SE 46.

[28]  Béla Bollobás,et al.  Sparse random graphs with clustering , 2008, Random Struct. Algorithms.

[29]  Béla Bollobás,et al.  The Cut Metric, Random Graphs, and Branching Processes , 2009, 0901.2091.

[30]  Zhuoqing Morley Mao,et al.  Automated Classification and Analysis of Internet Malware , 2007, RAID.

[31]  Farnam Jahanian,et al.  A Survey of Botnet Technology and Defenses , 2009, 2009 Cybersecurity Applications & Technology Conference for Homeland Security.

[32]  Béla Bollobás,et al.  Random Graphs , 1985 .

[33]  Massimo Franceschetti,et al.  Critical node lifetimes in random networks via the chen-stein method , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..