Yahan Lyu

dblp:360/1835 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0009-5592-727XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 100%
Artificial intelligence
1 paper
Generative modeling · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security
anonymity networks
1.012026
Amoeba: Defending Against Deep Website Fingerprinting Attacks With GAN-Based Trace Generative Model · IEEE Trans. Netw. 2026
Network security
traffic analysis
1.012026
Amoeba: Defending Against Deep Website Fingerprinting Attacks With GAN-Based Trace Generative Model · IEEE Trans. Netw. 2026
Network security › traffic analysis
website fingerprinting defense
1.012026
Amoeba: Defending Against Deep Website Fingerprinting Attacks With GAN-Based Trace Generative Model · IEEE Trans. Netw. 2026
Machine learning › Generative modeling
generative adversarial network
0.312026
Amoeba: Defending Against Deep Website Fingerprinting Attacks With GAN-Based Trace Generative Model · IEEE Trans. Netw. 2026
Machine learning › Generative modeling › generative adversarial network
Wasserstein GAN
0.312026
Amoeba: Defending Against Deep Website Fingerprinting Attacks With GAN-Based Trace Generative Model · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

dummy packet padding · 2.0adversarial learning · 2.0Wasserstein GAN · 2.0
YearPublicationVenuePosition
2026 Amoeba: Defending Against Deep Website Fingerprinting Attacks With GAN-Based Trace Generative Model
abstract
Deep neural network-based website fingerprinting (WF) attacks have significantly threatened anonymous communication systems, like The Onion Router (Tor). WF defense methods based on adversarial learning techniques offer potential resistance against deep WF attacks. However, existing defenses primarily focus on packet-level perturbations, often neglecting fine-grained perturbations at the packet interval-level. In this paper, we present a novel WF defense method, called Amoeba, which is designed to generate traces that incorporate both packet-level and packet interval-level perturbations to defend against deep WF attacks while maintaining controllable overhead. Amoeba employs a two-stage framework: in the first stage, it learns the trace patterns by adversarial learning techniques with Wasserstein Generative Adversarial Networks (WGAN). The second stage introduces a dynamic cost control mechanism to pad dummy packets into normal traces to perturb trace patterns with low bandwidth overhead and time costs. Furthermore, we collect a new Tor trace dataset with Tor anonymous communication system and conduct extensive experiments on both a public dataset and our collected dataset. Experimental results demonstrate that Amoeba can reduce the classification accuracy of deep WF attacks from over 90% to below 40%, and outperform existing defenses. Moreover, Amoeba has over 4% bandwidth overhead and 13% time costs reduction than existing defenses, which shows the effectiveness and superiority of Amoeba in resisting deep WF attacks compared to existing methods.
Qiang Zhou 0010, Yahan Lyu, Liangmin Wang 0001, Jiadong Shi
IEEE Trans. Netw.2