Demo Data from SIGIR 2026 / reviewers in the wild / expert
Shuofeng Liu
dblp:360/6399
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0002-6438-5224ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers |
Security and privacy of machine learning · 70% Privacy and data protection · 30% | |
| Artificial intelligence
1 paper |
Generative modeling · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › diffusion model › text-to-image generation
safety filter bypass |
0.9 | 1 | 2025 | Modifier Unlocked: Jailbreaking Text-to-Image Models Through Prompts · SP 2025 |
Machine learning › Generative modeling › diffusion model
text-to-image generation |
0.9 | 1 | 2025 | Modifier Unlocked: Jailbreaking Text-to-Image Models Through Prompts · SP 2025 |
Security and privacy of machine learning › adversarial attack
adversarial attacks on generative models |
0.9 | 1 | 2025 | Modifier Unlocked: Jailbreaking Text-to-Image Models Through Prompts · SP 2025 |
Security and privacy of machine learning › adversarial attack
jailbreak attack |
0.9 | 1 | 2025 | Modifier Unlocked: Jailbreaking Text-to-Image Models Through Prompts · SP 2025 |
Privacy and data protection › privacy compliance
purpose limitation |
0.8 | 1 | 2024 | Being Transparent is Merely the Beginning: Enforcing Purpose Limitation with Polynomial Approximation · USENIX Security Symposium 2024 |
Methods — techniques the papers use, named apart from their topics
modifier-based attack · 1.7heuristic algorithm · 1.7polynomial approximation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ClieND: Client-Side Neuron-Level Detection against Poisoning Attacks on Cross-Silo Federated LearningabstractPoisoning attacks have been shown to pose significant threats to federated learning (FL), including both untargeted and targeted attacks. To mitigate such threats, the majority of existing defenses are implemented on the server side during the aggregation process. However, as data remains inherently local in FL, these defenses either rely on unreliable statistical or structural properties of local updates, or make strong assumptions that rely on dataset information. As a result, the unique advantage of clients having access to trusted local data and training dynamics has been largely overlooked. In this work, we propose ClieND1, a novel client-side detection framework that shifts the detection of poisoning attacks from the server to the client. Specifically, ClieND enables each client to maintain the neuron importance scores of the aggregated global model in each round by leveraging its local dataset. Through tracking the inter-round changes in these scores, each client detects abnormal behavior by identifying significant discrepancy spikes, which serve as indicators of potential poisoning attacks. To evaluate the effectiveness of ClieND, we compare it against three state-of-the-art baselines under both targeted and untargeted poisoning attacks, and also assess its ability to detect attacks at an early stage. Experimental results show that ClieND achieves a false positive rate (FPR) as low as 0.01 and a true positive rate (TPR) of up to 0.99, which significantly outperforms server-side defenses, demonstrating its high detection accuracy. Additionally, the existence of poisoning attacks, even those launched by adaptive settings, can be detected in an early stage within 5 communication rounds. Mengyao Ma, Shuofeng Liu, Viet Vo, Minghong Fang, Surya Nepal, Guangdong Bai |
AsiaCCS | 2 |
| 2025 | Modifier Unlocked: Jailbreaking Text-to-Image Models Through PromptsabstractThe unprecedented image generation capability of text-to-image models makes them double-edged swords. While these models allow users to create exquisite images through simple prompts, they also provide adversaries with opportunities to generate Not-Safe-for-Work (NSFW) content, referred to as the jailbreak attack. Despite built-in safety filters serving as a mitigation, their vulnerabilities and associated safety issues remain a significant concern. In this work, we propose MODX, the first modifier-based attack framework for jailbreaking text-to-image models. Modx leverages a heuristic algorithm with two heuristic functions (constraints) to identify modifiers that adjust the artistic genre to subtly introduce unsafe elements that drive the generated images towards NSFW. This approach takes advantage of the fact that filters are unlikely to reject images in certain styles or artistic forms, effectively inducing the models to generate NSFW content. We demonstrate the feasibility of modifier-based jailbreaking with a theoretical analysis, and provide experimental evidence of the effectiveness of MODX. Our results show that MODX outperforms existing methods in successfully achieving jailbreaking across four state-of-the-art text-to-image models. Moreover, we evaluate MODX across additional NSFW categories and on more models or model versions, demonstrating its strong scalability and generalization. Disclaimer: This paper contains NSFW language and imagery that could be offensive, distressing, and/or upsetting. Reader discretion is advised. Shuofeng Liu, Mengyao Ma, Minhui Xue 0001, Guangdong Bai |
SP | 1 |
| 2024 | Unveiling Intellectual Property Vulnerabilities of GAN-Based Distributed Machine Learning through Model Extraction AttacksabstractGenerative Adversarial Networks (GANs), as a cornerstone of artificial intelligence (AI), are widely recognized as the intellectual property (IP) of their owners, given the sensitivity of the training data and the commercial value tied to the models. Model extraction attacks, which aim to steal well-trained proprietary models, pose a significant threat to model IP. Nevertheless, current research predominately focuses on the context of machine learning as a service (MLaaS), where the emphasis lies in understanding the attack knowledge acquired through black-box API queries. This restricted perspective exposes a critical gap in investigating model extraction attacks within realistic distributed settings for generative tasks. In this work, we present the first investigation into model extraction attacks against GANs in distributed settings. We provide a comprehensive attack taxonomy, considering three different levels of knowledge the adversary can obtain in practice. Based on it, we introduce a novel model extraction attack named MoEx, which focuses on the GAN-based distributed learning scenario, i.e., Multi-Discriminator GANs, a typical asymmetric distributed setting. MoEx uses the objective function simulation, leveraging data exchanged during the learning process, to approximate the GAN generator owned by the server. We define two attack goals for MoEx, fidelity extraction and accuracy extraction . Then we comprehensively evaluate the effectiveness of MoEx's two goals with real-world datasets. Our results demonstrate its robust capabilities in extracting generators with high fidelity and accuracy compared with existing methods. Mengyao Ma, Shuofeng Liu, Mahawaga Arachchige Pathum Chamikara, Mohan Baruwal Chhetri, Guangdong Bai |
CIKM | 2 |
| 2024 | Being Transparent is Merely the Beginning: Enforcing Purpose Limitation with Polynomial Approximation
Shuofeng Liu, Minhui Xue 0001, Guangdong Bai |
USENIX Security Symposium | 1 |
| 2023 | Formalizing Robustness Against Character-Level Perturbations for Neural Network Language Models
Zhongkui Ma, Xinguo Feng, Shuofeng Liu, Mengyao Ma, Hao Guan 0001, Mark Huasong Meng |
ICFEM | 4 |