A malware signature extraction and detection method applied to mobile networks

被引:6
作者
Hu, Guoning [1 ]
Venugopal, Deepak [1 ]
机构
[1] SMobile Syst, 2020 Leonard Ave, Columbus, OH 43220 USA
来源
2007 IEEE INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE, VOLS 1 AND 2 | 2007年
关键词
D O I
10.1109/PCCC.2007.358875
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The rapid development of mobile phone networks has facilitated the need for better protection against malware. Malware defection is a core component of a security system protecting mobile networks. In this paper, we describe a system for detecting malware within the network traffic using malware signatures. Our system contains two key components. The first one automatically extracts a set of signatures from existing malware samples. In particular, we reduce the number of signatures by using a common signature for a malware and its variants. In addition, we minimize the total false alarm rate of malware detection by extracting signatures that are most uncommon within mobile network traffic. The second one is an efficient method that scans the network traffic using a hash table and sub-signature matching. Our evaluation on Symbian viruses show that our system detects existing malware and their new variants within the network traffic efficiently.
引用
收藏
页码:19 / +
页数:2
相关论文
共 15 条
  • [1] Semantics-aware malware detection
    Christodorescu, M
    Jha, S
    Seshia, SA
    Song, D
    Bryant, RE
    [J]. 2005 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2005, : 32 - 46
  • [2] Cormen T. H., 2001, Introduction to Algorithms, V2nd
  • [3] Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd, DOI [DOI 10.1002/0471200611, 10.1002/0471200611]
  • [4] Mobile phones as computing devices: The viruses are coming!
    Dagon, D
    Martin, T
    Starner, T
    [J]. IEEE PERVASIVE COMPUTING, 2004, 3 (04) : 11 - 15
  • [5] A threshold of in n for approximating set cover
    Feige, U
    [J]. JOURNAL OF THE ACM, 1998, 45 (04) : 634 - 652
  • [6] Kephart J.O., 1994, P 4 VIRUS B INT C, P178
  • [7] KIM HA, 2004, USENIX SECURITY S
  • [8] ON THE HARDNESS OF APPROXIMATING MINIMIZATION PROBLEMS
    LUND, C
    YANNAKAKIS, M
    [J]. JOURNAL OF THE ACM, 1994, 41 (05) : 960 - 981
  • [9] Maurer W. D., 1975, Computing Surveys, V7, P5, DOI 10.1145/356643.356645
  • [10] RYSAVY P, 1999, EVOLUTION CELLULAR D