Ming Kang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ming Kang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Wen Chen
School of Cyber Science and Engineering, Sichuan University, Chengdu, China
3 shared publications - Andrew Beng Jin Teoh
School of Electrical and Electronic Engineering, College of Engineering, Yonsei University, Seoul, Republic of Korea
1 shared publication - Bob Zhang
University of Macau, Macau SAR, China
1 shared publication - Changzhi Wang
School of Cyber Science and Engineering, Sichuan University, Chengdu 610065, China
1 shared publication Chengrui Gao
College of Computer Science, Sichuan University, Chengdu, China
1 shared publication- Chengwei Liu
Nanyang Technological University
1 shared publication
Latest Publications
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1651-1663
How Effective Are NPM Malicious Package Detectors? A Large-Scale Empirical Study
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1651-1663
Open AccessHow Effective Are NPM Malicious Package Detectors? A Large-Scale Empirical Study
- 22 March 2026
- Published by Elsevier in Computer Networks
- Vol. 281
DYNAMO: An adaptive spatio-Temporal attention method for provenance graph-based APT detection
- 22 March 2026
- Published by Elsevier in Computer Networks
- Vol. 281
DYNAMO: An adaptive spatio-Temporal attention method for provenance graph-based APT detection
- 8 February 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 312
MGAN-LD: A sparse label propagation-based anomaly detection approach using multi-generative adversarial networks
- 8 February 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 312
MGAN-LD: A sparse label propagation-based anomaly detection approach using multi-generative adversarial networks
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 8587-8599
A Dual-Level Cancelable Framework for Palmprint Verification and Hack-Proof Data Storage
In recent years, palmprints have been extensively utilized for individual verification. The abundance of sensitive information in palmprint data necessitates robust protection to ensure security and privacy without compromising system performance. Existing systems frequently use cancelable transformations to protect palmprint templates. However, if an adversary gains access to the stored database, they could initiate a replay attack before the system detects the breach and can revoke and replace the reference template. To address replay attacks while meeting template protection criteria, we propose a dual-level cancelable palmprint verification framework. In this framework, the reference template is initially transformed using a cancelable competition hashing network with a first-level token, enabling the end-to-end generation of cancelable templates. During enrollment, the system creates a negative database (NDB) using a second-level token for further protection. Due to the unique NDB-to-vector matching characteristic, a replay attack involving the matching between the reference template and a compromised instance in NDB form is infeasible. This approach effectively addresses the replay attack problem at its root. Furthermore, the dual-level protected reference template enjoys heightened security, as reversing the NDB is NP-hard. We also propose a novel NDB-to-vector matching algorithm based on matrix operations to expedite the matching process, addressing the inefficiencies of previous NDB methods reliant on dictionary-based matching rules. Extensive experiments conducted on public palmprint datasets confirm the effectiveness and generality of the proposed framework. Upon acceptance of the paper, the code will be accessible at https://github.com/Zi-YuanYang/DCPV.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 8587-8599
A Dual-Level Cancelable Framework for Palmprint Verification and Hack-Proof Data Storage
In recent years, palmprints have been extensively utilized for individual verification. The abundance of sensitive information in palmprint data necessitates robust protection to ensure security and privacy without compromising system performance. Existing systems frequently use cancelable transformations to protect palmprint templates. However, if an adversary gains access to the stored database, they could initiate a replay attack before the system detects the breach and can revoke and replace the reference template. To address replay attacks while meeting template protection criteria, we propose a dual-level cancelable palmprint verification framework. In this framework, the reference template is initially transformed using a cancelable competition hashing network with a first-level token, enabling the end-to-end generation of cancelable templates. During enrollment, the system creates a negative database (NDB) using a second-level token for further protection. Due to the unique NDB-to-vector matching characteristic, a replay attack involving the matching between the reference template and a compromised instance in NDB form is infeasible. This approach effectively addresses the replay attack problem at its root. Furthermore, the dual-level protected reference template enjoys heightened security, as reversing the NDB is NP-hard. We also propose a novel NDB-to-vector matching algorithm based on matrix operations to expedite the matching process, addressing the inefficiencies of previous NDB methods reliant on dictionary-based matching rules. Extensive experiments conducted on public palmprint datasets confirm the effectiveness and generality of the proposed framework. Upon acceptance of the paper, the code will be accessible at https://github.com/Zi-YuanYang/DCPV.