Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zefeng Wu

dblp:340/9648 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0005-0383-2624ORCID · reported

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

Computer networks · 1 · 1 since 2021Security and privacy · 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
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › adversarial attack
backdoor attack
1.012026
Catch Me If You Can: Retain High Stealthiness and Durability of Backdoor Attack in Federated Learning · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning › federated learning defense
byzantine-robust aggregation
1.012026
Catch Me If You Can: Retain High Stealthiness and Durability of Backdoor Attack in Federated Learning · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning › federated learning security
federated learning attack
1.012026
Catch Me If You Can: Retain High Stealthiness and Durability of Backdoor Attack in Federated Learning · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning
federated learning defense
1.012026
Catch Me If You Can: Retain High Stealthiness and Durability of Backdoor Attack in Federated Learning · IEEE Trans. Inf. Forensics Secur. 2026

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

importance metric · 1.0adaptive proactive boosting · 1.0
YearPublicationVenuePosition
2026 Catch Me If You Can: Retain High Stealthiness and Durability of Backdoor Attack in Federated Learning
abstract
Federated Learning (FL) is vulnerable to backdoor attacks by design since it cannot inspect clients’ local data to protect their privacy. This privacy-preserving feature creates an opportunity for malicious clients to introduce backdoors. However, existing backdoor attacks face two main limitations. First, brute amplification (i.e., uniformly scaling up malicious parameters) can be easily detected, hence compromising attack stealthiness. Second, evasion strategies employed to prevent their backdoors from being overwritten by benign updates are frequently ineffective, reducing the overall attack stability upon model deployment. To address these limitations, we propose an adaptive proactive boosting strategy to enhance both the stealthiness and durability of backdoor attacks in FL. As a concrete example,ReBAintroduces a durable importance metric based on stability degrees of parameters as an update mask for malicious attackers, assigning higher weights to backdoor-related parameters during the update process. To ensure stealthiness,ReBAformulates an optimization problem regarding amplification factor by minimizing the distance between malicious and clean updates, thereby correcting malicious updates within a benign distance space. Extensive evaluations on 3 datasets and across 14 defenses demonstrate the efficacy ofReBA, outperforming over 12 baseline backdoor attacks. Our code is available at https://anonymous.4open.science/r/ReBA-D82F.
Yilong Yang 0004, Xinjing Liu, Zefeng Wu, Zhuoran Ma 0002, Yong Zeng 0002, Xianjia Meng, Zhuo Ma 0001
IEEE Trans. Inf. Forensics Secur.3
2025 Robust Open Set Specific Emitter Identification Using Reciprocal Points Learning and Deep Reconstruction Learning
abstract
In smart wireless communication environments, specific emitter identification (SEI) technology has become a crucial means to ensure the security and stability of the wireless communication system. With the rapid increase in the number of Internet of Things (IoT) devices, traditional closed-set identification methods are no longer adequate to handle dynamic and complex wireless environments, particularly for unknown and rogue device intrusions. Consequently, open set SEI (OS-SEI) methods have emerged, which not only identify known devices but also effectively detect previously unseen rogue devices, thereby providing enhanced security and reliability. Therefore, this paper proposes an OS-SEI method based on reciprocal points learning and deep reconstruction learning (RPDRL). Firstly, by introducing an attention-based convolutional autoencoder (ACAE) with skip-layer connections (SC), which is used for deep reconstruction learning, along with reciprocal points learning (RPL), the extracted features become more robust. Furthermore, we design a classification algorithm that combines an appropriate fingerprint metric and extreme value theory (EVT), effectively achieving the detection of rogue devices and the classification of known devices. An open-source automatic dependent surveillance-broadcast (ADS-B) dataset and an intercom dataset are used to evaluate the RPDRL-based OS-SEI method. Experimental results indicate that the proposed method achieves an accuracy of 94.88% on the ADS-B dataset and 96.00% on the intercom dataset. Ablation experiments demonstrate the effectiveness of the efficient channel attention (ECA) modules and SC in the proposed network structure, as well as the efficacy of each loss function.
Shufei Wang, Zefeng Wu, Hao Huang 0008, Yun Lin 0005, Guan Gui 0001
IEEE Internet Things J.2