Siyi Xiao , Lejun Zhang , Zhihong Tian , Shen Su , Jing Qiu , Ran Guo
{"title":"Pheromone-based graph embedding algorithm for Ethereum phishing detection","authors":"Siyi Xiao , Lejun Zhang , Zhihong Tian , Shen Su , Jing Qiu , Ran Guo","doi":"10.1016/j.comnet.2025.111123","DOIUrl":null,"url":null,"abstract":"<div><div>Phishing scams pose significant risks to Ethereum, the second-largest blockchain-based cryptocurrency platform. Traditional methods for identifying phishing activities, such as machine learning and network representation learning, struggle to capture the temporal and repetitive transaction patterns inherent in Ethereum’s transaction network. To address these limitations, we propose a Pheromone-based Graph Embedding Algorithm (PGEA), which leverages pheromone mechanisms and a taboo list inspired by ant colony behavior to enhance subgraph sampling. This approach improves the identification of phishing activities by ensuring subgraph homogeneity and isomorphism during the sampling process. In our methodology, Ethereum transaction data is collected from known phishing addresses to construct a transaction network graph. The PGEA guides subgraph sampling, producing sequences that are transformed into node embeddings using word2vec. These embeddings are then classified using a Support Vector Machine (SVM) to distinguish between legitimate and malicious nodes. Experimental results demonstrate the superiority of our model over existing methods. PGEA achieves an accuracy of 87.18%, precision of 91.01%, recall of 84.82%, and F1 score of 86.91%, outperforming baseline approaches such as Deepwalk, Node2vec, and Graph2vec. These results highlight the efficacy of PGEA in detecting phishing addresses, contributing to a more secure Ethereum ecosystem.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111123"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S138912862500091X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Phishing scams pose significant risks to Ethereum, the second-largest blockchain-based cryptocurrency platform. Traditional methods for identifying phishing activities, such as machine learning and network representation learning, struggle to capture the temporal and repetitive transaction patterns inherent in Ethereum’s transaction network. To address these limitations, we propose a Pheromone-based Graph Embedding Algorithm (PGEA), which leverages pheromone mechanisms and a taboo list inspired by ant colony behavior to enhance subgraph sampling. This approach improves the identification of phishing activities by ensuring subgraph homogeneity and isomorphism during the sampling process. In our methodology, Ethereum transaction data is collected from known phishing addresses to construct a transaction network graph. The PGEA guides subgraph sampling, producing sequences that are transformed into node embeddings using word2vec. These embeddings are then classified using a Support Vector Machine (SVM) to distinguish between legitimate and malicious nodes. Experimental results demonstrate the superiority of our model over existing methods. PGEA achieves an accuracy of 87.18%, precision of 91.01%, recall of 84.82%, and F1 score of 86.91%, outperforming baseline approaches such as Deepwalk, Node2vec, and Graph2vec. These results highlight the efficacy of PGEA in detecting phishing addresses, contributing to a more secure Ethereum ecosystem.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.