Defending against malicious nodes using an SVM based Reputation System
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) de...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 7 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Akbani, Rehan Korkmaz, Turgay Raju, G. V. S. |
description | 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. |
doi_str_mv | 10.1109/MILCOM.2008.4753370 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4753370</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4753370</ieee_id><sourcerecordid>4753370</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-534a2e54f3e69f6f2d54eaca5c530563b52060879691d99da6ce6c6a870c3553</originalsourceid><addsrcrecordid>eNpVkMtqwkAYhacXodbmCdzMC8TO7Z_LsqS1FRKEWrqVMfkjU0wiTrLw7autFHo2B84H3-IQMuVsxjlzj8Uiz5bFTDBmZ8qAlIZdkcQZy5VQSmhj4JqMBQdIDVh9849pe_vHjB2R-7PGMQAQdySJ8YudooBzrsZk_ow1tlVot9RvfWhjTxu_C2XohkjbrsJIh_hDW7r6LOjGR6zoO-6H3vehO43H2GPzQEa130VMLj0hq_nLR_aW5svXRfaUp8GxPgWpvEBQtUTtal2LChT60kMJkoGWGxBMM2ucdrxyrvK6RF1qbw0rJYCckOmvNSDien8IjT8c15eD5Ddz9VJ-</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Defending against malicious nodes using an SVM based Reputation System</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Akbani, Rehan ; Korkmaz, Turgay ; Raju, G. V. S.</creator><creatorcontrib>Akbani, Rehan ; Korkmaz, Turgay ; Raju, G. V. S.</creatorcontrib><description>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.</description><identifier>ISSN: 2155-7578</identifier><identifier>ISBN: 9781424426768</identifier><identifier>ISBN: 1424426766</identifier><identifier>EISSN: 2155-7586</identifier><identifier>EISBN: 9781424426775</identifier><identifier>EISBN: 1424426774</identifier><identifier>DOI: 10.1109/MILCOM.2008.4753370</identifier><identifier>LCCN: 2008905552</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Bayesian methods ; Feedback ; Integral equations ; Linear algebra ; Mathematical model ; Peer to peer computing ; Support vector machines</subject><ispartof>MILCOM 2008 - 2008 IEEE Military Communications Conference, 2008, p.1-7</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4753370$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4753370$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Akbani, Rehan</creatorcontrib><creatorcontrib>Korkmaz, Turgay</creatorcontrib><creatorcontrib>Raju, G. V. S.</creatorcontrib><title>Defending against malicious nodes using an SVM based Reputation System</title><title>MILCOM 2008 - 2008 IEEE Military Communications Conference</title><addtitle>MILCOM</addtitle><description>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.</description><subject>Algorithm design and analysis</subject><subject>Bayesian methods</subject><subject>Feedback</subject><subject>Integral equations</subject><subject>Linear algebra</subject><subject>Mathematical model</subject><subject>Peer to peer computing</subject><subject>Support vector machines</subject><issn>2155-7578</issn><issn>2155-7586</issn><isbn>9781424426768</isbn><isbn>1424426766</isbn><isbn>9781424426775</isbn><isbn>1424426774</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtqwkAYhacXodbmCdzMC8TO7Z_LsqS1FRKEWrqVMfkjU0wiTrLw7autFHo2B84H3-IQMuVsxjlzj8Uiz5bFTDBmZ8qAlIZdkcQZy5VQSmhj4JqMBQdIDVh9849pe_vHjB2R-7PGMQAQdySJ8YudooBzrsZk_ow1tlVot9RvfWhjTxu_C2XohkjbrsJIh_hDW7r6LOjGR6zoO-6H3vehO43H2GPzQEa130VMLj0hq_nLR_aW5svXRfaUp8GxPgWpvEBQtUTtal2LChT60kMJkoGWGxBMM2ucdrxyrvK6RF1qbw0rJYCckOmvNSDien8IjT8c15eD5Ddz9VJ-</recordid><startdate>200811</startdate><enddate>200811</enddate><creator>Akbani, Rehan</creator><creator>Korkmaz, Turgay</creator><creator>Raju, G. V. S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200811</creationdate><title>Defending against malicious nodes using an SVM based Reputation System</title><author>Akbani, Rehan ; Korkmaz, Turgay ; Raju, G. V. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-534a2e54f3e69f6f2d54eaca5c530563b52060879691d99da6ce6c6a870c3553</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>Bayesian methods</topic><topic>Feedback</topic><topic>Integral equations</topic><topic>Linear algebra</topic><topic>Mathematical model</topic><topic>Peer to peer computing</topic><topic>Support vector machines</topic><toplevel>online_resources</toplevel><creatorcontrib>Akbani, Rehan</creatorcontrib><creatorcontrib>Korkmaz, Turgay</creatorcontrib><creatorcontrib>Raju, G. V. S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Akbani, Rehan</au><au>Korkmaz, Turgay</au><au>Raju, G. V. S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Defending against malicious nodes using an SVM based Reputation System</atitle><btitle>MILCOM 2008 - 2008 IEEE Military Communications Conference</btitle><stitle>MILCOM</stitle><date>2008-11</date><risdate>2008</risdate><spage>1</spage><epage>7</epage><pages>1-7</pages><issn>2155-7578</issn><eissn>2155-7586</eissn><isbn>9781424426768</isbn><isbn>1424426766</isbn><eisbn>9781424426775</eisbn><eisbn>1424426774</eisbn><abstract>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.</abstract><pub>IEEE</pub><doi>10.1109/MILCOM.2008.4753370</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2155-7578 |
ispartof | MILCOM 2008 - 2008 IEEE Military Communications Conference, 2008, p.1-7 |
issn | 2155-7578 2155-7586 |
language | eng |
recordid | cdi_ieee_primary_4753370 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithm design and analysis Bayesian methods Feedback Integral equations Linear algebra Mathematical model Peer to peer computing Support vector machines |
title | Defending against malicious nodes using an SVM based Reputation System |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T19%3A48%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Defending%20against%20malicious%20nodes%20using%20an%20SVM%20based%20Reputation%20System&rft.btitle=MILCOM%202008%20-%202008%20IEEE%20Military%20Communications%20Conference&rft.au=Akbani,%20Rehan&rft.date=2008-11&rft.spage=1&rft.epage=7&rft.pages=1-7&rft.issn=2155-7578&rft.eissn=2155-7586&rft.isbn=9781424426768&rft.isbn_list=1424426766&rft_id=info:doi/10.1109/MILCOM.2008.4753370&rft_dat=%3Cieee_6IE%3E4753370%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424426775&rft.eisbn_list=1424426774&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4753370&rfr_iscdi=true |