Propagation model of smartphone worms based on semi-Markov process and social relationship graph
Data(s) |
01/07/2014
|
---|---|
Resumo |
Smartphone applications are getting more and more popular and pervasive in our daily life, and are also attractive to malware writers due to their limited computing source and vulnerabilities. At the same time, we possess limited understanding of our opponents in cyberspace. In this paper, we investigate the propagation model of SMS/MMS-based worms through integrating semi-Markov process and social relationship graph. In our modeling, we use semi-Markov process to characterize state transition among mobile nodes, and hire social network theory, a missing element in many previous works, to enhance the proposed mobile malware propagation model. In order to evaluate the proposed models, we have developed a specific software, and collected a large scale real-world data for this purpose. The extensive experiments indicate that the proposed models and algorithms are effective and practical. © 2014 Elsevier Ltd. All rights reserved. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Elsevier |
Relação |
http://dro.deakin.edu.au/eserv/DU:30072594/peng-propogationmodelof-2014.pdf http://www.dx.doi.org/10.1016/j.cose.2014.04.006 |
Direitos |
2014, Elsevier |
Palavras-Chave | #Propagation model #Semi-Markov process #Smartphone #Social relationship graph #Worm #Science & Technology #Technology #Computer Science, Information Systems #Computer Science #NETWORKS #DYNAMICS |
Tipo |
Journal Article |