DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16089
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhatia, Ashutosh-
dc.date.accessioned2024-10-15T08:54:24Z-
dc.date.available2024-10-15T08:54:24Z-
dc.date.issued2021-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/9333989-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16089-
dc.description.abstractThe Onion Router (TOR) networks provide anonymity, in terms of identity and location, to the Internet users by encrypting traffic multiple times along the path and routing it via an overlay network of servers. Although TOR was initially developed as a medium to maintain users' privacy, cyber criminals and hackers take advantage of this anonymity, and as a result, many illegal activities are carried out using TOR networks. With the ever-changing landscape of Internet services, traditional traffic analysis methods are not efficient for analyzing encrypted traffic and there is a need for alternative methods for analyzing TOR traffic. In this paper, we develop a machine learning model to identify whether a given network traffic is TOR or nonTOR. We use the ISCX2016 TOR-nonTOR dataset to train our model and perform random oversampling and random undersampling to remove data imbalance. Furthermore, to improve the efficiency of our classifiers, we use k-fold cross-validation and Grid Search algorithms for hyperparameter tuning. Results show that we achieve more than 90% accuracy with random sampling and hyperparameter tuning methodsen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectComputer Scienceen_US
dc.subjectTORen_US
dc.subjectGrid Search Algorithmsen_US
dc.subjectMachine learning (ML)en_US
dc.titleImproving the performance of Machine Learning Algorithms for TOR detectionen_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.