GL‐WF: A lightweight graph learning model for website fingerprinting attacks

Abstract Website fingerprinting attacks that analyze clients' browsing preferences are an important information source for maintaining cybersecurity and improving big data utilization in terms of service quality. Many scholars have studied graph learning because of its powerful learning and inferential capabilities on unstructured network traffic. However, the extensive computing resource requirements of graph neural networks limit their application to large‐scale and automated scenarios. In this paper, we propose a lightweight graph learning method for website fingerprinting attacks called GL‐WF. We designed a four‐level heterogeneous spatiotemporal graph using a multimodal representation of website browsing traffic. We then utilized a graph sampling algorithm to refine the structure of the graph. Finally, a well‐designed graph isomorphism network was used to extract the graph topology for the traffic classifiers. The proposed GL‐WF model, which was evaluated on over 3.6 million website flows, was found to provide high accuracy and efficiency.

Authors

Institutions

Publication Details

Journal
ETRI Journal
Published
2025-11-26
DOI
https://doi.org/10.4218/etrij.2024-0197
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GL‐WF: A lightweight graph learning model for website fingerprinting attacks

Jianan Huang, Fengyuan Nie, Weiwei Liu, Guangjie Liu et al.
ETRI Journal
Internet Traffic Analysis and Secure E-voting
article

GL‐WF: A lightweight graph learning model for website fingerprinting attacks

Jianan Huang, Fengyuan Nie, Weiwei Liu, Guangjie Liu, Junzhe Zhang, Bo Gao
article en

Abstract

Abstract Website fingerprinting attacks that analyze clients' browsing preferences are an important information source for maintaining cybersecurity and improving big data utilization in terms of service quality. Many scholars have studied graph learning because of its powerful learning and inferential capabilities on unstructured network traffic. However, the extensive computing resource requirements of graph neural networks limit their application to large‐scale and automated scenarios. In this paper, we propose a lightweight graph learning method for website fingerprinting attacks called GL‐WF. We designed a four‐level heterogeneous spatiotemporal graph using a multimodal representation of website browsing traffic. We then utilized a graph sampling algorithm to refine the structure of the graph. Finally, a well‐designed graph isomorphism network was used to extract the graph topology for the traffic classifiers. The proposed GL‐WF model, which was evaluated on over 3.6 million website flows, was found to provide high accuracy and efficiency.

ETRI JournalVol. 48(1)
Nanjing University of Information Science and Technology (CN), Nanjing University of Science and Technology (CN), National Earthquake Response Support Service (CN), Ministry of Industry and Information Technology (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 80%
Internet Traffic Analysis and Secure E-voting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.