paper-with-me

홈 › Papers

Locality Sensitive Hashing for Network Traffic Fingerprinting

2024-02-12 · Nowfel Mashnoor, Jay Thom, Abdur Rouf, Shamik Sengupta, Batyr Charyyev

The advent of the Internet of Things (IoT) has brought forth additional intricacies and difficulties to computer networks. These gadgets are particularly susceptible to cyber-attacks because of their simplistic design. Therefore, it is crucial to recognise these devices inside a network for the purpose of network administration and to identify any harmful actions. Network traffic fingerprinting is a crucial technique for identifying devices and detecting anomalies. Currently, the predominant methods for this depend heavily on machine learning (ML). Nevertheless, machine learning (ML) methods need the selection of features, adjustment of hyperparameters, and retraining of models to attain optimal outcomes and provide resilience to concept drifts detected in a network. In this research, we suggest using locality-sensitive hashing (LSH) for network traffic fingerprinting as a solution to these difficulties. Our study focuses on examining several design options for the Nilsimsa LSH function. We then use this function to create unique fingerprints for network data, which may be used to identify devices. We also compared it with ML-based traffic fingerprinting and observed that our method increases the accuracy of state-of-the-art by 12% achieving around 94% accuracy in identifying devices in a network.

📄 PDF Abstract BibTeX arXiv:2402.08063

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Locality-sensitive hashing in function spaces

2020-02-10 · Will Shand, Stephen Becker

We discuss the problem of performing similarity search over function spaces. To perform search over such spaces in a reasonable amount of time, we use {\it locality-sensitive hashing} (LSH). We present two methods that a…

Super-Bit Locality-Sensitive Hashing

2012-12-01 · NeurIPS 2012 12 · Jianqiu Ji, Jianmin Li, Shuicheng Yan, Bo Zhang 외

Sign-random-projection locality-sensitive hashing (SRP-LSH) is a probabilistic dimension reduction method which provides an unbiased estimate of angular similarity, yet suffers from the large variance of its estimation. …

Dimensionality ReductionRetrieval

Hashing for Similarity Search: A Survey

2014-08-13 · Jingdong Wang, Heng Tao Shen, Jingkuan Song, Jianqiu Ji

Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and…

Survey

Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search

2022-06-03 · Ninh Pham, Tao Liu

We present Falconn++, a novel locality-sensitive filtering approach for approximate nearest neighbor search on angular distance. Falconn++ can filter out potential far away points in any hash bucket \textit{before} query…

Ranking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashing

2017-03-16 · Zhe Jin, Yen-Lung Lai, Jung-Yeon Hwang, Soo-Hyung Kim 외

In this paper, we propose a ranking based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed "Index-of-Max" (IoM) hashing for biometric template protection. With externally generated random para…