Blocking Spam by Separating End-User Machines from Legitimate Mail Server Machines

Blocking Spam by Separating End-User Machines from Legitimate Mail Server Machines

Blocking Spam By Separating End-User Machines from Legitimate Mail Server Machines Fernando Sanchez Zhenhai Duan Yingfei Dong Florida State University Florida State University University of Hawaii [email protected] [email protected] [email protected] ABSTRACT Spamming botnets present a critical challenge in the control Given the importance of controlling spam to improve the of spam messages due to the sheer volume and wide spread trustworthiness and usability of the Internet email system, of the botnet members. In this paper we advocate the ap- many anti-spam systems have been developed over the years proach for recipient mail servers to filter messages directly (see [2, 9, 18, 19, 21, 23] and the references therein). In delivered from remote end-user (EU) machines, given that response, spammers have also developed advanced spam- the majority of spamming bots are EU machines. We de- ming infrastructures and techniques to infiltrate and evade velop a Support Vector Machine (SVM) based classifier to the deployed anti-spam systems. In particular, the spam- separate EU machines from legitimate mail server (LMS) ming infrastructure has evolved from spammers' own mail machines, using a set of machine features that cannot be servers, to open relays [1], and nowadays to spamming bot- easily manipulated by spammers. We investigate the ef- nets (networks of compromised machines used for sending ficacy and performance of the SVM-based classifier using spam) [10, 24]. Various studies have shown that spam mes- a number of real-world data sets. Our performance stud- sages sent from botnets accounted for above 80% of all spam ies show that the SVM-based classifier is indeed a feasible messages on the Internet in recent years [10, 12]. For exam- and effective approach in distinguishing EU machines from ple, the MessageLabs Intelligence 2010 annual security re- LMS machines. For example, training and testing on an port showed that approximately 88:2% of all spam in 2010 aggregated data set containing both EU machines and LMS were sent from botnets. machines, the SVM-based classifier can achieve a 99:27% de- Spamming botnets present a significant challenge in the tection accuracy, with very small false positive rate (0:44%) control of spam messages because of the sheer volume and and false negative rate (1:1%), significantly outperforming wide spread of their members. These two natures of spam- eight DNS-based blacklists widely used today. ming botnets render many anti-spam techniques less effec- tive, such as the reactive DNS-based blacklists (DNSBL) and reputation-based spam filtering schemes. Given that Categories and Subject Descriptors spammers have a large pool of spamming bots to use, it C.2.0 [Computer-Communication Networks]: General| is essentially impossible for reactive DNSBLs to maintain Security and protection; H.4.3 [Information Systems Ap- a complete and up-to-date list of IP addresses involved in plications]: Communications Applications|Electronic mail spamming. Similarly, given the large number of members ; I.5.4 [Pattern Recognition]: Applications|Text pro- in a spamming botnet, each spamming bot only needs to cessing send a small portion of the total spam messages in a spam campaign. From an individual recipient network domain's General Terms perspective, the number of spam messages sent from a spam- ming bot could be too small to trigger a reputation system Security, Algorithms, Performance to respond. More importantly, the majority of existing anti- spam schemes allow for the arms race between the spammers Keywords and the anti-spam community, and they encourage spam- Content-Independent Spam Control, Spamming Bot, Ma- mers to recruit large number of spamming bots and explore chine Classification, Learning novel usage of these spamming bots. Rather than allowing for the arms race between spammers and the anti-spam community in the war of botnet-based 1. INTRODUCTION spamming, in this paper we will develop a novel scheme that targets the root cause of the problem to discourage (and ide- ally, to prohibit) spammers from using botnets to send spam Permission to make digital or hard copies of all or part of this work for messages. A key observation that motivates this approach personal or classroom use is granted without fee provided that copies are is that the majority of spamming bots are end-user (EU) not made or distributed for profit or commercial advantage and that copies machines instead of legitimate mail server (LMS) machines, bear this notice and the full citation on the first page. To copy otherwise, to given that legitimate (mail) server machines are normally republish, to post on servers or to redistribute to lists, requires prior specific well protected and less likely to be compromised. A legiti- permission and/or a fee. CEAS '11, September 1-2, 2011, Perth, Australia. mate email message is normally composed on an EU machine Copyright 2011 ACM 978-1-4503-0788-8/11/09 ...$10.00. and then delivered to the local mail server of the sender net- system using the SVM-based classifier as the SVM-based fil- work domain, from where it is further delivered to the recip- tering system (or simply the SVM-based system, when there ient mail server. In contrast, spam messages originated from is no confusion). In this system, we train the SVM-based spamming botnets are normally directly delivered from the classifier using a data set including both EU machines and EU machines (where a customized mail server software is in- LMS machines, based on the history of the emails received stalled) to the recipient mail servers. By blocking messages by the local system. In building the SVM-based classifier, directly delivered from remote EU machines, we can effec- a set of machine features that cannot be easily manipulated tively prohibit spammers from using compromised machines by spammers will be used. to send spam messages. When an incoming email delivery request comes, the re- In this paper we aim to develop a lightweight yet effective cipient mail server can use the SVM-based classifier to deter- scheme to distinguish EU machines from LMS machines so mine if the sending machine is an EU machine or an LMS that messages delivered from remote EU machines can be machine. Based on the type of the sending machine, the blocked. Many features can be used to determine if a send- recipient mail server can process the message differently de- ing machine is an EU machine or an LMS machine. However, pending on the local configured policy. For example, one in this paper we focus on the features of a sending machine policy could be to directly reject the message delivery re- that cannot be easily manipulated by a spammer, and are quest from the remote machine if it is an EU machine. An- already available at or can be easily obtained by a recipient other possible policy is to feed the machine classification mail server. In particular, we consider two types of features information to a more comprehensive spam filtering system associated with a sending machine: the operating system such as SpamAssassin [18], which can use this classification (OS) and the hostname lexical structure of the sending ma- information as one of the factors to determine the likelihood chine. Based on the OS and hostname lexical features of of the incoming message being a spam. In this paper we sending machines, we develop a lightweight Support Vector only focus on the machine classification problem and will Machine (SVM) based classifier to separate EU machines not discuss further how classification results may be used by from LMS machines [17]. individual recipient mail servers. In addition to presenting the SVM-based classifier, we also In the following we will first present a brief description of evaluate the efficacy and effectiveness of the classifier us- SVM and then we will discuss the machine features that we ing real-world data sets, and compare the performance of use in the design of the SVM-based classifier. the developed classifier with eight commonly used DNSBL systems. The evaluation studies show that our SVM-based 2.1 Support Vector Machines classifier has a very high detection accuracy (percentage of SVM is a popular machine learning method due to its ro- machines that are classified correctly) with very low false bust performance in a wide range of problem domains. In positive and false negative rates. For example, on an ag- essence, SVM is a linear learning algorithm by transforming gregated data set containing both EU machines and LMS input data (where the decision function may not be linear) machines, the SVM-based classifier can achieve a 99:27% into a high-dimensional feature space (where the decision detection accuracy, with a false positive rate of 0:44% and function is linear), using a mapping function φ(x). In real- false negative rate of 1:1%, significantly outperforming all ity, the mapping function is never performed by using the eight DNSBLs considered in the study. so called \kernel trick", which is used to compute the dot The remainder of the paper is structured as follows. In product of two data points in the mapped high-dimensional Section 2 we present the design of the SVM-based classi- feature space. There are a number of well studied kernel fier including the machine features used in the study. In functions for this purpose. To a degree, kernel function of Sections 3 and 4 we describe the data sets used for the per- two data points measures the similarity (closeness) between formance studies and the results of the performance stud- the two data points. ies of the SVM-based classifier, respectively. In Section 5 Given a set of training data containing m data points n we discuss the related work, the potential techniques that (xi; yi), for i = 1; 2; : : : ; m, where xi 2 R , and yi = {−1; +1g, spammers may develop to evade the SVM-based classifier, SVM aims to identify the linear separating hyperplane with and the limitations of the SVM-based classifier.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    9 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us