Demo Data from VLDB 2026 / reviewers in the wild / expert
Wanying Dai
dblp:314/3036
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0002-4267-0745ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 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 |
Biometric security · 72% Security and privacy of machine learning · 28% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning
adversarial machine learning |
1.0 | 1 | 2026 | Benchmarking Deepfake Attacks on Deep Face Recognition Systems · IEEE Trans. Dependable Secur. Comput. 2026 |
Biometric security › face recognition
face recognition security |
1.0 | 1 | 2026 | Benchmarking Deepfake Attacks on Deep Face Recognition Systems · IEEE Trans. Dependable Secur. Comput. 2026 |
Biometric security
biometric template protection |
0.8 | 1 | 2024 | Chaos-Based Index-of-Min Hashing Scheme for Cancellable Biometrics Security · IEEE Trans. Inf. Forensics Secur. 2024 |
Biometric security › biometric template protection
cancelable biometrics |
0.8 | 1 | 2024 | Chaos-Based Index-of-Min Hashing Scheme for Cancellable Biometrics Security · IEEE Trans. Inf. Forensics Secur. 2024 |
Methods — techniques the papers use, named apart from their topics
taxonomy construction · 1.0benchmarking · 1.0index-of-min hashing · 0.8chaos-based transformation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Benchmarking Deepfake Attacks on Deep Face Recognition SystemsabstractModern deep face recognition systems are crucial for identity verification and authentication in high-stakes sectors such as security, finance, and law enforcement. However, their reliability is increasingly threatened by the rapid advancement of deepfake technology. Despite considerable attention, comprehensive evaluation of how emerging deepfake generation methods affect reliability of face recognition systems remains lacking. In this paper, we introduce a principled taxonomy and a benchmarking framework that structure deepfake attacks by intent and generative mechanism, enabling consistent and comprehensive assessment. Numerous results show that diverse deepfake attacks commonly exceed 70% success and, in some regimes, surpass 90%. Built on this foundation, we investigate the underlying mechanisms across different deepfake techniques, providing not only broad empirical evaluation but also valuable insight into what drives attack success. Our in-depth analysis reveals that success is not governed by visual quality, but rather by the degree of identity controllability. Shu Peng, Naipeng Dong, Wanying Dai, Guangdong Bai |
IEEE Trans. Dependable Secur. Comput. | 3 |
| 2025 | FracFace: Breaking the Visual Clues - Fractal-Based Privacy-Preserving Face RecognitionabstractFace recognition is essential for identity authentication, but the rich visual clues in facial images pose significant privacy risks, highlighting the critical importance of privacy-preserving solutions. For instance, numerous studies have shown that generative models are capable of effectively performing reconstruction attacks that result in the restoration of original visual clues. To mitigate this threat, we introduce FracFace, a fractal-based privacy-preserving face recognition framework. This approach effectively weakens the visual clues that can be exploited by reconstruction attacks by disrupting the spatial structure in frequency domain features, while retaining the vital visual clues required for identity recognition. To achieve this, we craft a Frequency Channels Refining module that reduces sparsity in the frequency domain. It suppresses visual clues that could be exploited by reconstruction attacks, while preserving features indispensable for recognition, thus making these attacks more challenging. More significantly, we design a Frequency Fractal Mapping module that obfuscates deep representations by remapping refined frequency channels into a fractal-based privacy structure. By leveraging the self-similarity of fractals, this module preserves identity relevant features while enhancing defense capabilities, thereby improving the overall robustness of the protection scheme. Experiments conducted on multiple public face recognition benchmarks demonstrate that the proposed FracFace significantly reduces the visual recoverability of facial features, while maintaining high recognition accuracy, as well as the superiorities over state-of-the-art privacy protection approaches. Wanying Dai, Beibei Li 0002, Naipeng Dong, Guangdong Bai, Jin Song Dong 0001 |
NeurIPS | 1 |
| 2024 | Chaos-Based Index-of-Min Hashing Scheme for Cancellable Biometrics SecurityabstractCancellable biometrics is essential for preserving sensitive biometric information from potential exposure. Existing studies usually convert real-valued biometric vectors into protected templates by randomly generated transformation keys. However, this way is realized by the built-in functions of the cancellable biometric system, which creates vulnerabilities for cancellable biometric schemes. In this paper, we propose a novel chaos-based Index-of-Min cancellable biometric scheme, named C-IoM, for privacy-preserving template updates in biometric technique. Specifically, we first design a chaos-based cancellable biometric framework to ensure the security and privacy of the biometric template. Second, we develop a secure random chaos seed generation algorithm, which non-linearly converts the biometric vectors into protected templates and conceals biometric dimensional information. Further, we craft a sliding window selection mechanism to choose the input biometric features, allowing each feature data to fully participate in the generation of protected templates through sliding intervals. Theoretical analysis confirms that the C-IoM satisfies the criteria of irreversibility, revocability, unlinkability, and performance preservation in cancellable biometrics. Extensive experiments on LFW, CFPW, and CASIA-V5 datasets demonstrate the security of the proposed framework in protecting biometric data as well as the superiorities over state-of-the-art schemes. Wanying Dai, Beibei Li 0002, Qingyun Du, Ao Liu 0005 |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2023 | A Lightweight Few-Shot Attack Detection Scheme for Industrial Cognitive Radio NetworksabstractIndustrial cognitive radio networks (ICRNs) have been a promising spectrum -sharing solution for massive resource-constrained wireless devices in the industrial Internet of things (1IoT). However, ICRNs are raising new opportunities for ma-licious users, wherein the threat landscape is compounded with few-shot attacks due to the insufficiency of high-quality examples. In this paper, we propose a novel lightweight intrusion detection system focusing on few-shot attacks for ICRNs, called KDFS-IDS. Specifically, we first develop a teacher-student model based hierarchical intrusion detection framework for ICRNs. Second, we design a convolutional neural network-based intrusion detection model as the fundamental model for identifying few-shot attacks. Third, a knowledge distillation strategy is crafted to obtain a lightweight but sufficiently accurate model for KDFS-IDS. Extensive experiments on three public datasets demonstrate the superiorities of our proposed scheme in detecting few-shot attacks for I CRN s, in terms of both effectiveness and accuracy. Beibei Li 0002, Wanying Dai, Rongkuan Ma, Hanyuan Huang |
GLOBECOM | 3 |