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

Mingsi Wang

dblp:77/11264 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Computer graphics and multimedia
2 papers
Visual content generation and editing · 86% Geometric modeling and processing · 14%
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
Visual content generation and editing › image animation
human image animation
0.912025
Dormant: Defending against Pose-driven Human Image Animation · USENIX Security Symposium 2025
Security and privacy of machine learning › generative model security
generative model misuse
0.912025
Dormant: Defending against Pose-driven Human Image Animation · USENIX Security Symposium 2025
Geometric modeling and processing › surface fitting
b-spline surface fitting
0.112012
B-spline surface fitting by iterative geometric interpolation/approximation algorithms · Comput. Aided Des. 2012
Mathematical optimization › iterative methods
successive approximation
0.012012
B-spline surface fitting by iterative geometric interpolation/approximation algorithms · Comput. Aided Des. 2012

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

adversarial perturbation · 1.7
YearPublicationVenuePosition
2026 A survey on physical adversarial attacks against face recognition systems
Mingsi Wang, Jiachen Zhou 0001, Tianlin Li, Guozhu Meng, Kai Chen 0012
Neurocomputing1
2025 DEO: Jailbreak a Black-box Multimodal Large Language Model with Dual-Embedding Alignment
abstract
Multimodal Large Language Models (MLLMs), which integrate textual and visual modalities, have demonstrated unparalleled capabilities in diverse multimodal tasks. However, the inclusion of visual inputs exposes MLLMs to security risks, one of which is jailbreak attacks. Although various methods have been proposed to jailbreak MLLMs via the visual modality, attacks in black-box settings have some limitations. Existing black-box attacks either fail to generate precise harmful outputs in practical scenarios or require substantial preparatory work in constructing adversarial images. In this work, we propose a novel dual-embedding optimization (DEO) attack approach to generate visual adversarial perturbations that induce the MLLMs to produce harmful responses that violate common AI safety policies. Specifically, DEO iteratively optimizes the visual input by enforcing alignment objectives across both the input and output embedding spaces: the image embedding of the input and the text embedding generated by the MLLM are both required to align with a harmful target text within a shared embedding space, which is defined by a frozen pretrained encoder. This alignment is conducted entirely under a black-box setting using a query-based strategy, where the attacker issues queries and observes only the model’s outputs, without access to its internal parameters or gradients. By optimizing in the dual-embedding space, our method can generate an adversarial perturbation to elicit more harmful and precise responses, overcoming the limitations of existing approaches. Experimental results demonstrate that our method significantly improves attack success rates of existing black-box attack methods by up to 30% against two MLLM families, including MiniGPT4 and LLaVa, achieving an average attack success rate of 87% across different models and eight scenarios, demonstrating its superior attack effectiveness. These findings highlight the urgent need for systematic robustness evaluations and improved safety mechanisms in MLLMs.1Content Warning: This paper contains harmful model responses.
Mingsi Wang, Yue Zhao 0018, Zijin Lin, Kai Chen 0012
IJCNN2
2025 SAP-DIFF: Semantic Adversarial Patch Generation for Black-Box Face Recognition Models via Diffusion Models
abstract
Given the need to evaluate the robustness of face recognition (FR) models, many efforts have focused on adversarial patch attacks that mislead FR models by introducing localized perturbations. Impersonation attacks are a significant threat because adversarial perturbations allow attackers to disguise themselves as legitimate users. This can lead to severe consequences, including data breaches, system damage, and misuse of resources. However, research on such attacks in FR remains limited. Existing adversarial patch generation methods exhibit limited efficacy in impersonation attacks due to (1) the need for high attacker capabilities, (2) low attack success rates, and (3) excessive query requirements. To address these challenges, we propose a novel method SAP-DIFF that leverages diffusion models to generate adversarial patches via semantic perturbations in the latent space rather than direct pixel manipulation. We introduce an attention disruption mechanism to generate features unrelated to the original face, facilitating the creation of adversarial samples and a directional loss function to guide perturbations toward the target identity's feature space, thereby enhancing attack effectiveness and efficiency. Extensive experiments on popular FR models and datasets demonstrate that our method outperforms state-of-the-art approaches, achieving an average attack success rate improvement of 45.66% (all exceeding 40%), and a reduction in the number of queries by about 40% compared to the SOTA approach.
Mingsi Wang, Shuaiyin Yao, Chang Yue, Guozhu Meng
ICMR1
2025 Dormant: Defending against Pose-driven Human Image Animation
Jiachen Zhou 0001, Mingsi Wang, Tianlin Li, Guozhu Meng, Kai Chen 0012
USENIX Security Symposium2
2023 Break the Data Barriers While Keeping Privacy: A Graph Differential Privacy Method
abstract
The booming development of Internet of Vehicles (IoV) has brought new vitality to the construction of intelligent transportation systems (ITS). At the same time, a huge amount of data has been generated due to the gradual development of IoV toward large scale, complex, and diversified. These data are owned by the companies that vehicles belonging to or service providers, such as taxi companies own taxi data. Due to interest and privacy considerations, data owners are not willing to share data, thus a serious data isolated island problem is created, which is detrimental to the development of ITS. Therefore, this article focuses on how to prevent privacy disclosure of vehicles while sharing vehicle data to improve the service. Considering the amount of interactive data and privacy disclosure during data release, vehicle data are abstracted from text form into a graph-structured data form. At the same time, graph differential privacy (DP) together with anonymity protection is proposed innovatively to firmly protect vehicle privacy. Moreover, to solve the high complexity of big data graph-structure transformation, an accelerated nodes and edges combined graph DP (ACGDP) algorithm is proposed. Based on the simulations of real-world data that combine electric and nonelectric taxies, it is verified that our proposed scheme has a tradeoff between information availability and privacy protection. With the graph DP processed data, our proposed scheme reduces the average wasted mileage for charging by 3.87% and achieves a 44.28% increase in drivers’ income. Drivers’ satisfaction of receiving orders and charging preference reaches 68% after the graph-structured data reuse.
Xiaofeng Tao 0001, Xuefei Zhang 0003, Mingsi Wang, Shuo Wang 0027
IEEE Internet Things J.4
2012 B-spline surface fitting by iterative geometric interpolation/approximation algorithms
Yuki Kineri, Mingsi Wang, Takashi Maekawa
Comput. Aided Des.2