Call Graph and Model Checking for Fine-Grained Android Malicious Behaviour Detection

被引:10
作者
Iadarola, Giacomo [1 ]
Martinelli, Fabio [1 ]
Mercaldo, Francesco [1 ,2 ]
Santone, Antonella [2 ]
机构
[1] Natl Res Council Italy, Inst Informat & Telemat, I-56124 Pisa, Italy
[2] Univ Molise, Dept Med & Hlth Sci Vincenzo Tiberio, I-86100 Campobasso, Italy
来源
APPLIED SCIENCES-BASEL | 2020年 / 10卷 / 22期
关键词
malware; model checking; formal methods; security; Android; mobile;
D O I
10.3390/app10227975
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The increasing diffusion of mobile devices, widely used for critical tasks such as the transmission of sensitive and private information, corresponds to an increasing need for methods to detect malicious actions that can undermine our data. As demonstrated in the literature, the signature-based approach provided by antimalware is not able to defend users from new threats. In this paper, we propose an approach based on the adoption of model checking to detect malicious families in the Android environment. We consider two different automata representing Android applications, based respectively on Control Flow Graphs and Call Graphs. The adopted graph data structure allows to detect potentially malicious behaviour and also localize the code where the malicious action happens. We experiment the effectiveness of the proposed method evaluating more than 3000 real-world Android samples (with 2552 malware belonging to 21 malicious family), by reaching an accuracy ranging from 0.97 to 1 in malicious family detection.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 38 条
[31]  
Mercaldo F, 2016, FME WORKS FORM, P22, DOI [10.1109/FormaliSE.2016.012, 10.1145/2897667.2897673]
[32]   Ransomware Steals Your Phone. Formal Methods Rescue It [J].
Mercaldo, Francesco ;
Nardone, Vittoria ;
Santone, Antonella ;
Visaggio, Corrado Aaron .
FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS (FORTE 2016), 2016, 9688 :212-221
[33]  
Milner R., 1989, Communication and concurrency
[34]  
MILNER R, 1992, INFORM COMPUT, V100, P1, DOI [10.1016/0890-5401(92)90008-4, 10.1016/0890-5401(92)90009-5]
[35]  
Orailoglu A., 1986, 23rd ACM/IEEE Design Automation Conference. Proceedings 1986 (Cat. No.86CH2288-9), P503, DOI 10.1145/318013.318093
[36]  
Pedreschi D, 2019, AAAI CONF ARTIF INTE, P9780
[37]  
Stirling, 1989, CONCURRENCY THEORY L, P2
[38]  
Vallée-Rai R, 2000, LECT NOTES COMPUT SC, V1781, P18