TY - GEN
T1 - Defending against malicious nodes using an SVM based reputation system
AU - Akbani, Rehan
AU - Korkmaz, Turgay
AU - Raju, G. V.S.
N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - Many networks, such as P2P networks, MANETs, file sharing networks, and online auction networks rely on node cooperation. If a malicious node gains access to such a network it can easily launch attacks, such as spreading viruses or spam, or attacking known vulnerabilities. Reputation Systems (RS) defend against malicious nodes by observing their past behavior in order to predict their future behavior. These RSs usually comprise of statistical models or equations that are designed by hand and only defend against specific patterns of attacks. In this paper, we propose a Support Vector Machines (SVM) based RS that defends against many patterns of attacks. It can be retrained to detect new attack patterns as well. We discuss the challenges associated with building RSs and how our RS tackles each of them. We compare the performance of our RS with another RS found in the literature, called TrustGuard, and perform detailed evaluations against a variety of attacks. The results show that our RS significantly outperforms TrustGuard. Even when the proportion of malicious nodes in the network is large, our RS can discriminate between good and malicious nodes with high accuracy. In addition our scheme has very low bandwidth overheads.
AB - Many networks, such as P2P networks, MANETs, file sharing networks, and online auction networks rely on node cooperation. If a malicious node gains access to such a network it can easily launch attacks, such as spreading viruses or spam, or attacking known vulnerabilities. Reputation Systems (RS) defend against malicious nodes by observing their past behavior in order to predict their future behavior. These RSs usually comprise of statistical models or equations that are designed by hand and only defend against specific patterns of attacks. In this paper, we propose a Support Vector Machines (SVM) based RS that defends against many patterns of attacks. It can be retrained to detect new attack patterns as well. We discuss the challenges associated with building RSs and how our RS tackles each of them. We compare the performance of our RS with another RS found in the literature, called TrustGuard, and perform detailed evaluations against a variety of attacks. The results show that our RS significantly outperforms TrustGuard. Even when the proportion of malicious nodes in the network is large, our RS can discriminate between good and malicious nodes with high accuracy. In addition our scheme has very low bandwidth overheads.
UR - http://www.scopus.com/inward/record.url?scp=62349088428&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=62349088428&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2008.4753370
DO - 10.1109/MILCOM.2008.4753370
M3 - Conference contribution
AN - SCOPUS:62349088428
SN - 9781424426775
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
T2 - 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success
Y2 - 17 November 2008 through 19 November 2008
ER -