Yifan Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yifan Wang has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Jinchuan Tang
State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang 550025, China
1 shared publication - Shuping Dang
Department of Electrical & Electronic Engineering, University of Bristol, Bristol BS8 1QU, UK
1 shared publication
Latest Publications
- Open Access
- 4 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1988
A Conditional Diffusion Graph Privacy Protection Model Based on Task-Aware Attention and Hierarchical Adversarial Constraints
Graph representation learning models inherently capture structural and attribute correlations, which may lead to significant privacy risks under attribute inference attacks. Existing privacy-preserving methods mainly focus on post hoc suppression of generated node representations, while insufficiently considering how to directly weaken sensitive-attribute cues and their inferable associations during the representation recovery stage. To address this issue, this paper proposes a conditional diffusion-based graph privacy protection model with task-aware attention and hierarchical adversarial constraints, termed Task-Aware Adversarial Conditional Diffusion (TA-ACD). Specifically, a Graph Convolutional Network (GCN) is employed to construct a conditional diffusion denoising network for node representation recovery. Sensitive-attribute condition switching is introduced to alter the recovery path, thereby weakening the inferable association between sensitive attributes and node representations. Meanwhile, task-aware attention is embedded into the denoising process to preserve task-relevant discriminative information. Furthermore, node-level and global statistical adversarial constraints are designed to suppress residual sensitive information from both local and global perspectives. Finally, an alternating training strategy is adopted to achieve collaborative optimization between privacy protection and utility preservation. Experimental results on Yale, Rochester, and the Credit defaulter datasets show that TA-ACD achieves a competitive privacy–utility trade-off compared with representative baselines. On the Yale dataset, TA-ACD reduces sensitive-attribute inference accuracy from 86.3% to 62.1%, corresponding to a decrease of 24.2 percentage points, while maintaining a utility-attribute classification accuracy of 85.6%.
- 4 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1988
Open AccessA Conditional Diffusion Graph Privacy Protection Model Based on Task-Aware Attention and Hierarchical Adversarial Constraints
Graph representation learning models inherently capture structural and attribute correlations, which may lead to significant privacy risks under attribute inference attacks. Existing privacy-preserving methods mainly focus on post hoc suppression of generated node representations, while insufficiently considering how to directly weaken sensitive-attribute cues and their inferable associations during the representation recovery stage. To address this issue, this paper proposes a conditional diffusion-based graph privacy protection model with task-aware attention and hierarchical adversarial constraints, termed Task-Aware Adversarial Conditional Diffusion (TA-ACD). Specifically, a Graph Convolutional Network (GCN) is employed to construct a conditional diffusion denoising network for node representation recovery. Sensitive-attribute condition switching is introduced to alter the recovery path, thereby weakening the inferable association between sensitive attributes and node representations. Meanwhile, task-aware attention is embedded into the denoising process to preserve task-relevant discriminative information. Furthermore, node-level and global statistical adversarial constraints are designed to suppress residual sensitive information from both local and global perspectives. Finally, an alternating training strategy is adopted to achieve collaborative optimization between privacy protection and utility preservation. Experimental results on Yale, Rochester, and the Credit defaulter datasets show that TA-ACD achieves a competitive privacy–utility trade-off compared with representative baselines. On the Yale dataset, TA-ACD reduces sensitive-attribute inference accuracy from 86.3% to 62.1%, corresponding to a decrease of 24.2 percentage points, while maintaining a utility-attribute classification accuracy of 85.6%.