DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/8378
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNarang, Pratik-
dc.contributor.authorNarang, Pratik-
dc.date.accessioned2023-01-09T04:07:47Z-
dc.date.available2023-01-09T04:07:47Z-
dc.date.issued2014-05-
dc.identifier.urihttps://dl.acm.org/doi/abs/10.1145/2611286.2611318?preflayout=flat-
dc.identifier.urihttps://dl.acm.org/doi/abs/10.1145/2611286.2611318?preflayout=flat-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8378-
dc.description.abstractThe distributed and decentralized nature of P2P botnets makes their detection a challenging task. Further, the botmasters continuously try to improve their botnets in order to evade existing detection mechanisms. Thus, although a lot of research has been seen in this field, their detection continues to be an important area of research. This work proposes a novel approach for the detection of P2P botnets by converting the 'time-domain' network communications of P2P botnets to 'frequency-domain'. We adopt a signal-processing based approach by treating the traffic of each pair of nodes seen in network traffic as a 'signal'. Apart from the regular 'network behavior' based features, we extract features based on Discrete Fourier Transforms and Shannon's Entropy theory to build supervised machine learning models for the detection of P2P botnets. Herein we present encouraging results obtained from the preliminary experiments.en_US
dc.language.isoenen_US
dc.publisherACM Digital Libraryen_US
dc.subjectComputer Scienceen_US
dc.subjectP2P botneten_US
dc.subjectSignal-processing techniquesen_US
dc.subjectMachine-learningen_US
dc.titleMachine-learning approaches for P2P botnet detection using signal-processing techniquesen_US
dc.typeArticleen_US
Appears in Collections:Department of Computer Science and Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.