Hui Sun

Hui Sun

Auto-generated profile, based on publicly available information

Hui Sun

China University of Geosciences, Wuhan, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2021 in Information Fusion
Verified
Journal Article
Closed access
LLLin Li
Lin Li
FZFeng Zhu
Feng Zhu
HSHui Sun
Hui Sun
YHYiyi Hu
Yiyi Hu
YYYunyun Yang
Yunyun Yang
DJDawei Jin
Dawei Jin

7 November 2024 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
FGFaqian Guan
Faqian Guan
TZTianqing Zhu
Tianqing Zhu
HSHui Sun
Hui Sun
WZWanlei Zhou
Wanlei Zhou
PYPhilip S. Yu
Philip S. Yu
Graph data contains rich node features and unique edge information, which have been applied across various domains, such as citation networks or recommendation systems. Graph Neural Networks (GNNs) are specialized for handling such data and have shown impressive performance in many applications. However, GNNs may contain of sensitive information and susceptible to privacy attacks. For example, link stealing is a type of attack in which attackers infer whether two nodes are linked or not. Previous link stealing attacks primarily relied on posterior probabilities from the target GNN model, neglecting the significance of node features. Additionally, variations in node classes across different datasets lead to different dimensions of posterior probabilities. The handling of these varying data dimensions posed a challenge in using a single model to effectively conduct link stealing attacks on different datasets. To address these challenges, we introduce Large Language Models (LLMs) to perform link stealing attacks on GNNs. LLMs can effectively integrate textual features and exhibit strong generalizability, enabling attacks to handle diverse data dimensions across various datasets. We design two distinct LLM prompts to effectively combine textual features and posterior probabilities of graph nodes. Through these designed prompts, we fine-tune the LLM to adapt to the link stealing attack task. Furthermore, we fine-tune the LLM using multiple datasets and enable the LLM to learn features from different datasets simultaneously. Experimental results show that our approach significantly enhances the performance of existing link stealing attack tasks in both white-box and black-box scenarios. Our method can execute link stealing attacks across different datasets using only a single model, making link stealing attacks more applicable to real-world scenarios.

28 April 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HSHui Sun
Hui Sun
TZTianqing Zhu
Tianqing Zhu
WCWenhan Chang
Wenhan Chang
WZWanlei Zhou
Wanlei Zhou
As machine learning continues to develop and data misuse scandals become more prevalent, individuals are becoming increasingly concerned about their personal information and are advocating for the right to remove their data. Machine unlearning has emerged as a solution to erase training data from trained machine learning models. Despite its success in classifiers, research on Generative Adversarial Networks (GANs) is limited due to their unique architecture, including a generator and a discriminator. One challenge pertains to generator unlearning, as the process could potentially disrupt the continuity and completeness of the latent space. This disruption might consequently diminish the model's effectiveness after unlearning. Another challenge is how to define a criterion that the discriminator should perform for the unlearning images. In this paper, we introduce a substitution mechanism and define a fake label to effectively mitigate these challenges. Based on the substitution mechanism and fake label, we propose a cascaded unlearning approach for both item and class unlearning within GAN models, in which the unlearning and learning processes run in a cascaded manner. We conducted a comprehensive evaluation of the cascaded unlearning technique using the MNIST, CIFAR-10, and FFHQ datasets, analyzing its performance across four key aspects: unlearning effectiveness, intrinsic model performance, impact on downstream tasks, and unlearning efficiency. Experimental results demonstrate that this approach achieves significantly improved item and class unlearning efficiency, reducing the required time by up to $185\times$ and $284\times$ for the MNIST and CIFAR-10 datasets, respectively, in comparison to retraining from scratch. Notably, although the model's performance experiences minor degradation after unlearning, this reduction is negligible when dealing with a minimal number of images (e.g., 64) even for high-resolution FFHQ dataset and has no adverse effects on downstream tasks such as classification.

16 August 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HSHui Sun
Hui Sun
TZTianqing Zhu
Tianqing Zhu
JLJie Li
Jie Li
SJShoulin Ji
Shoulin Ji
WZWanlei Zhou
Wanlei Zhou
With breakthroughs in high-resolution image generation, applications for disentangled generative adversarial networks (GANs) have attracted much attention. At the same time, the privacy issues associated with GAN models have been raising many concerns. Membership inference attacks (MIAs), where an adversary attempts to determine whether or not a sample has been used to train the victim model, are a major risk with GANs. In prior research, scholars have shown that successful MIAs can be mounted by leveraging overfit images. However, high-resolution images make the existing MIAs fail due to their complexity. And the nature of disentangled GANs is such that the attributes are overfitting, which means that, for an MIA to be successful, it must likely be based on overfitting attributes. Furthermore, given the empirical difficulties with obtaining independent and identically distributed (IID) candidate samples, choosing the non-trivial attributes of candidate samples as the target for exploring overfitting would be a more preferable choice. Hence, in this paper, we propose a series of attribute-based MIAs that considers both black-box and white-box settings. The attacks are performed on the generator, and the inferences are derived by overfitting the non-trivial attributes. Additionally, we put forward a novel perspective on model generalization and a possible defense by evaluating the overfitting status of each individual attribute. A series of empirical evaluations in both settings demonstrate that the attacks remain stable and successful when using non-IID candidate samples. Further experiments illustrate that each attribute exhibits a distinct overfitting status. Moreover, manually generalizing highly overfitting attributes significantly reduces the risk of privacy leaks.

27 February 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HSHui Sun
Hui Sun
TZTianqing Zhu
Tianqing Zhu
JLJie Li
Jie Li
WZWanlei Zhou
Wanlei Zhou
Generative Adversarial Network (GAN) models have shown promise in detecting adversarial examples for classifiers by leveraging their ability to reconstruct benign and adversarial examples differently. However, existing approaches often struggle with reconstruction optimization convergence for adversarial examples, as GANs cannot perfectly reconstruct such inputs. To address this instability, we propose two novel methods: Average-RAED and Strict-RAED. Average-RAED focuses on the average reconstruction performance throughout the optimization process, with the difference in the classifier's logit information between the candidate sample and its reconstructed version as the detection signal. This approach enhances robustness and effectiveness, particularly for complex datasets. Strict-RAED integrates classification information into the reconstruction process and imposes a strict constraint to keep the latent code within the initial latent subspace. This design enables Strict-RAED to effectively identify both manually-crafted and natural adversarial examples. We evaluated both methods in a grey-box scenario, where the adversary has full knowledge of the target classifier's architecture and parameters but no information about the defense GAN. Our results demonstrate that both Average-RAED and Strict-RAED outperform baseline methods in distinguishing adversarial examples from benign samples. Notably, Strict-RAED achieves higher detection rates for both manually-crafted and natural adversarial examples. Furthermore, combining Strict-RAED for detection and Average-RAED for reforming candidate samples significantly improves classifier accuracy against less significant adversarial examples.

11 June 2026 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YXYongyi Xiao
Yongyi Xiao
TZTianqing Zhu
Tianqing Zhu
FGFaqian Guan
Faqian Guan
HSHui Sun
Hui Sun
JHJiayan Huang
Jiayan Huang
Antoni GrauAntoni Grau
Antoni Grau