Spatio-temporal Mining of Software Adoption & Penetration

被引:0
作者
Papalexakis, Evangelos E. [1 ]
Dumitras, Tudor [2 ]
Chau, Duen Horng [3 ]
Prakash, B. Aditya [4 ]
Faloutsos, Christos [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] Symantec Res Labs, Culver City, CA USA
[3] Georgia Tech, Atlanta, GA 30332 USA
[4] Virginia Tech, Blacksburg, VA 24061 USA
来源
2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM) | 2013年
关键词
Malware Propagation; Internet Security; Data Analysis;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
How does malware propagate? Does it form spikes over time? Does it resemble the propagation pattern of benign files, such as software patches? Does it spread uniformly over countries? How long does it take for a URL that distributes malware to be detected and shut down? In this work, we answer these questions by analyzing patterns from 22 million malicious (and benign) files, found on 1.6 million hosts worldwide during the month of June 2011. We conduct this study using the WINE database available at Symantec Research Labs. Additionally, we explore the research questions raised by sampling on such large databases of executables; the importance of studying the implications of sampling is twofold: First, sampling is a means of reducing the size of the database hence making it more accessible to researchers; second, because every such data collection can be perceived as a sample of the real world. Finally, we discover the SHARKFIN temporal propagation pattern of executable files, the GEOSPLIT pattern in the geographical spread of machines that report executables to Symantec's servers, the Periodic Power Law (PPL) distribution of the life-time of URLs, and we show how to efficiently extrapolate crucial properties of the data from a small sample. To the best of our knowledge, our work represents the largest study of propagation patterns of executables.
引用
收藏
页码:884 / 891
页数:8
相关论文
共 32 条
[1]   COEVOLUTION OF HOSTS AND PARASITES [J].
ANDERSON, RM ;
MAY, RM .
PARASITOLOGY, 1982, 85 (OCT) :411-426
[2]  
[Anonymous], 2012, 18 ACM SIGKDD INT C, DOI DOI 10.1145/2339530.2339537
[3]  
[Anonymous], ARXIV07042803
[4]  
[Anonymous], CONT PHYS
[5]  
[Anonymous], 2008, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM
[6]  
[Anonymous], 1949, Human behaviour and the principle of least-effort
[7]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[8]  
Bilge L, 2012, ACM C COMP COMM SEC
[9]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[10]  
Caballero Juan, 2011, USENIX SEC S USENIX