NUST Institutional Repository

Using machine learning techniques for censorship-resistant communication

Show simple item record

dc.contributor.author Huma, Zil e
dc.date.accessioned 2023-08-27T08:15:10Z
dc.date.available 2023-08-27T08:15:10Z
dc.date.issued 2021
dc.identifier.other 206493
dc.identifier.uri http://10.250.8.41:8080/xmlui/handle/123456789/37612
dc.description Supervisor: Dr. Syed Taha Ali en_US
dc.description.abstract To prevent citizens from accessing unfiltered information over the internet, repressive governments usually deploy national level censorship. To counter these censors, a number of systems have been introduced that make use of various allowed applications as covert channels and tunneling data through them. However, a drawback of these covert channels is their failure to maintain un-observability. The censors these days are capable enough to identify covert traffic amongst the stream of regular traffic. With censors getting more rigorous, some new ways of hiding blocked content in legitimate data streams have been introduced. These systems have very closely fooled the similarity based censors. However, Machine learning systems were still unbeaten. A recent study showed that some state-of-the-art Machine learning systems have been able to identify covert traffic, deeming the censor ship resistant models useless. In this thesis, we have used the strongest known Censorship-resistant system till date, to show that the system can be tweaked to defeat a machine learning based anomaly detection system. We have made use of adversarial machine learning techniques to beat some well-known classification techniques. Our results show that Adversarial examples can not only be used to hide blocked content in an application data stream but can also remain undetected. en_US
dc.language.iso en en_US
dc.publisher School of Electrical Engineering and computer Science (SEECS), NUST en_US
dc.title Using machine learning techniques for censorship-resistant communication en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

  • MS [375]

Show simple item record

Search DSpace


Advanced Search

Browse

My Account