mlsanityData to 13 Oct 2026

EUREKHA: Enhancing User Representation for Key Hackers Identification in Underground Forums

arXiv 2411.05479 ↗First posted 8 Nov 2024cs.CR cs.CL cs.SIcited by 2

Not on the map. Why?

Abstract (arXiv)

Underground forums serve as hubs for cybercriminal activities, offering a space for anonymity and evasion of conventional online oversight. In these hidden communities, malicious actors collaborate to exchange illicit knowledge, tools, and tactics, driving a range of cyber threats from hacking techniques to the sale of stolen data, malware, and zero-day exploits. Identifying the key instigators (i.e., key hackers), behind these operations is essential but remains a complex challenge. This paper presents a novel method called EUREKHA (Enhancing User Representation for Key Hacker Identification in Underground Forums), designed to identify these key hackers by modeling each user as a textual sequence. This sequence is processed through a large language model (LLM) for domain-specific adaptation, with LLMs acting as feature extractors. These extracted features are then fed into a Graph Neural Network (GNN) to model user structural relationships, significantly improving identification accuracy. Furthermore, we employ BERTopic (Bidirectional Encoder Representations from Transformers Topic Modeling) to extract personalized topics from user-generated content, enabling multiple textual representations per user and optimizing the selection of the most representative sequence. Our study demonstrates that fine-tuned LLMs outperform state-of-the-art methods in identifying key hackers. Additionally, when combined with GNNs, our model achieves significant improvements, resulting in approximately 6% and 10% increases in accuracy and F1-score, respectively, over existing methods. EUREKHA was tested on the Hack-Forums dataset, and we provide open-source access to our code.

Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 23 of its 72 references that are in the map. First posted on arXiv 8 Nov 2024.

Builds on

23 of 72 references.

References · 23

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,223
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,322
  4. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,318
  5. 2017Graph Attention Networkscited by 8,888
  6. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,360
  7. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,870
  8. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,810
  9. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,422
  10. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,171
  11. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,574
  12. 2021How Attentive are Graph Attention Networks?cited by 823
11 more
  1. 2022BERTopic: Neural topic modeling with a class-based TF-IDF procedurecited by 792
  2. 2019Heterogeneous Graph Attention Networkcited by 733
  3. 2019How to Fine-Tune BERT for Text Classification?cited by 411
  4. 2020Top2Vec: Distributed Representations of Topicscited by 125
  5. 2021BERT: A Review of Applications in Natural Language Processing and Understandingcited by 109
  6. 2017Latent Dirichlet Allocation (LDA) and Topic modeling: models, applications, a surveycited by 91
  7. 2016An Empirical Evaluation of doc2vec with Practical Insights into Document Embedding Generationcited by 48
  8. 2021Generating Fake Cyber Threat Intelligence Using Transformer-Based Modelscited by 29
  9. 2023LMBot: Distilling Graph Knowledge into Language Model for Graph-less Deployment in Twitter Bot Detectioncited by 17
  10. 2016Darknet and Deepnet Mining for Proactive Cybersecurity Threat Intelligencecited by 8
  11. 2022Parameter-Efficient Tuning with Special Token Adaptationcited by 7

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.