Wanpeng Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wanpeng Li has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Zhi Wang
College of Cryptology and Cyber Science, Nankai University, Tianjin, China
8 shared publications - Xiaoyu Cheng
Nankai University
4 shared publications - Chris Mitchell
Royal Holloway, University of London
3 shared publications - Haotong Liu
College of Cryptology and Cyber Science, Nankai University, Tianjin, China
3 shared publications - Yuejun Guo
Luxembourg Institute of Science and Technology, Luxembourg, Luxembourg
3 shared publications - Lifei Sun
Nankai University
2 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7429-7431
POSTER: Beyond Pickle-Free: Loading-Boundary Failures in Safetensors
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7429-7431
Open AccessPOSTER: Beyond Pickle-Free: Loading-Boundary Failures in Safetensors
- 19 July 2026
- Published by Springer Nature
- p. 13-24
PerCheck: An AST-Based Framework for Detecting Over-Privilege in Chrome Extensions
- 19 July 2026
- Published by Springer Nature
- p. 13-24
PerCheck: An AST-Based Framework for Detecting Over-Privilege in Chrome Extensions
- 13 July 2026
- Published by Springer Nature
- p. 27-38
A Hierarchical Adaptive Belief Rule Base for Chrome Extension Risk Assessment
- 13 July 2026
- Published by Springer Nature
- p. 27-38
A Hierarchical Adaptive Belief Rule Base for Chrome Extension Risk Assessment
- Open Access
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (FSE) , 3793-3815
DECODE: Dynamic Exploration for Constraint-Guided Vulnerability Discovery in Deep Learning Operators
The security and robustness of deep learning (DL) frameworks are vital, as vulnerabilities in low-level operator implementations can lead to serious reliability and security risks. While testing has proven effective in uncovering such flaws, existing techniques struggle to accurately capture the complex input constraints required by DL operators, resulting in low test coverage and missed bugs. To address this, we propose DECODE, a fully automated framework that performs efficient and precise constraint extraction through dynamic analysis. DECODE models operator-specific input requirements by observing valid execution traces and exploring constraint relationships. It then uses these refined constraints to generate high-quality test inputs capable of exposing memory error vulnerabilities. We evaluated DECODE on two widely used DL frameworks - TensorFlow and PyTorch - where it uncovered 96 bugs (54 in TensorFlow and 42 in PyTorch), 82 of which have been confirmed by developers. Compared to state-of-the-art tools, DECODE detected 41, 75, and 87 more bugs than IvySyn, DocTer, and DeepREL, respectively, demonstrating its superior effectiveness in uncovering previously undetected vulnerabilities.
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (FSE) , 3793-3815
Open AccessDECODE: Dynamic Exploration for Constraint-Guided Vulnerability Discovery in Deep Learning Operators
The security and robustness of deep learning (DL) frameworks are vital, as vulnerabilities in low-level operator implementations can lead to serious reliability and security risks. While testing has proven effective in uncovering such flaws, existing techniques struggle to accurately capture the complex input constraints required by DL operators, resulting in low test coverage and missed bugs. To address this, we propose DECODE, a fully automated framework that performs efficient and precise constraint extraction through dynamic analysis. DECODE models operator-specific input requirements by observing valid execution traces and exploring constraint relationships. It then uses these refined constraints to generate high-quality test inputs capable of exposing memory error vulnerabilities. We evaluated DECODE on two widely used DL frameworks - TensorFlow and PyTorch - where it uncovered 96 bugs (54 in TensorFlow and 42 in PyTorch), 82 of which have been confirmed by developers. Compared to state-of-the-art tools, DECODE detected 41, 75, and 87 more bugs than IvySyn, DocTer, and DeepREL, respectively, demonstrating its superior effectiveness in uncovering previously undetected vulnerabilities.
- Open Access
- 4 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1200-1212
CRX-ray: Large-Scale Detection of API Key Leakage in Browser Extensions
- 4 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1200-1212
Open AccessCRX-ray: Large-Scale Detection of API Key Leakage in Browser Extensions
- 21 April 2026
- Published by IOP Publishing in Engineering Research Express
- Vol. 8 (9)
A Belief Rule Base Method for Modeling Latent States with Uncertainty in Chrome Extension Risk Assessment
Chrome extensions, as popular browser functionality enhancement tools, often pose privacy risks due to permission-related issues. To address this, we propose a novel permission-based extension evaluation framework: RRIBRB-ExtPA (Rule Reduction Based Interval Belief Rule Base for Extension Permission-based Assessment, RRIBRB-ExtPA). This framework integrates our improved RRIBRB model. It reduces the dimension of precondition attributes. Rule combination and activation mechanisms are also optimized. Together, these improvements mitigate the rule explosion problem inherent in BRB models. Additionally, we introduce an overprivilege detection method to identify permission abuse behaviors in extensions, enhancing overall risk assessment capabilities. Experimental results demonstrate that RRIBRB-ExtPA maintains an accuracy rate of 98.6% even with an 87.5\% reduction in the number of rules, while exhibiting stable performance under small-sample conditions. This indicates that RRIBRB-ExtPA is a viable permission-based extension risk assessment framework.
- 21 April 2026
- Published by IOP Publishing in Engineering Research Express
- Vol. 8 (9)
A Belief Rule Base Method for Modeling Latent States with Uncertainty in Chrome Extension Risk Assessment
Chrome extensions, as popular browser functionality enhancement tools, often pose privacy risks due to permission-related issues. To address this, we propose a novel permission-based extension evaluation framework: RRIBRB-ExtPA (Rule Reduction Based Interval Belief Rule Base for Extension Permission-based Assessment, RRIBRB-ExtPA). This framework integrates our improved RRIBRB model. It reduces the dimension of precondition attributes. Rule combination and activation mechanisms are also optimized. Together, these improvements mitigate the rule explosion problem inherent in BRB models. Additionally, we introduce an overprivilege detection method to identify permission abuse behaviors in extensions, enhancing overall risk assessment capabilities. Experimental results demonstrate that RRIBRB-ExtPA maintains an accuracy rate of 98.6% even with an 87.5\% reduction in the number of rules, while exhibiting stable performance under small-sample conditions. This indicates that RRIBRB-ExtPA is a viable permission-based extension risk assessment framework.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3673-3685
An Empirical Study on Static Application Security Testing (SAST) Tools for Python
Python is currently the most popular programming language and ensuring the security of Python applications has become a critical concern. Static Application Security Testing (SAST) tools have been introduced to address this need, claiming to support a wide range of Common Weakness Enumerations (CWEs). However, the ability of these tools to detect real-world vulnerabilities in Python programs has not been comprehensively evaluated. In this paper, we selected eight SAST tools from 117 existing ones based on well-designed criteria. Based on the synthetic and real-world dataset, we evaluated and compared these SAST tools from different perspectives including effectiveness and efficiency. Our results reveal significant limitations in current SAST tools: although perform well on the synthetic dataset, a single tool detects no more than 40% of the vulnerabilities in our real-world dataset. Even when aggregating the outputs of all evaluated tools, only 66.7% of the real-world vulnerabilities are identified. To further understand these shortcomings, we performed a root cause analysis of the detection results and identified useful insights for both SAST tool designers and users, focusing on tool development, evaluation, and selection.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3673-3685
Open AccessAn Empirical Study on Static Application Security Testing (SAST) Tools for Python
Python is currently the most popular programming language and ensuring the security of Python applications has become a critical concern. Static Application Security Testing (SAST) tools have been introduced to address this need, claiming to support a wide range of Common Weakness Enumerations (CWEs). However, the ability of these tools to detect real-world vulnerabilities in Python programs has not been comprehensively evaluated. In this paper, we selected eight SAST tools from 117 existing ones based on well-designed criteria. Based on the synthetic and real-world dataset, we evaluated and compared these SAST tools from different perspectives including effectiveness and efficiency. Our results reveal significant limitations in current SAST tools: although perform well on the synthetic dataset, a single tool detects no more than 40% of the vulnerabilities in our real-world dataset. Even when aggregating the outputs of all evaluated tools, only 66.7% of the real-world vulnerabilities are identified. To further understand these shortcomings, we performed a root cause analysis of the detection results and identified useful insights for both SAST tool designers and users, focusing on tool development, evaluation, and selection.
- 31 October 2025
- Published by Springer Nature
- p. 418-430
Blockchain-Assisted Conditional Privacy-Preserving Authentication Scheme for VANETs
- 31 October 2025
- Published by Springer Nature
- p. 418-430
Blockchain-Assisted Conditional Privacy-Preserving Authentication Scheme for VANETs
- 16 May 2025
- Published by Springer Nature
- p. 101-120
Single Sign-On Security: An Empirical Study of Sign in with Apple
- 16 May 2025
- Published by Springer Nature
- p. 101-120
Single Sign-On Security: An Empirical Study of Sign in with Apple
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 7793-7808
Group-Grained Data Search and Sharing With Privacy Protection for Vehicular Social Networks
Vehicular social networks (VSNs) play a crucial role in intelligent transportation systems, offering high-quality data management services that enhance various aspects of daily life. Due to their convenience, VSN systems, equipped with advanced data search and sharing capabilities, are increasingly integrated into modern vehicles. While earlier VSNs focused on securing data communication between users, the transmission of sensitive vehicle and traffic data, like road conditions and vehicle trajectories, has raised privacy concerns and the risk of data leakage, which could harm vehicle owners’ interests. Historically, these systems focused primarily on securing data communication between VSN users. However, the transmission of sensitive vehicle and traffic data, such as road conditions and vehicle trajectory information, has raised concerns about data privacy and the potential risks of data leakage, which could compromise the interests of vehicle owners. To address these challenges, we propose a novel group-grained data search and sharing scheme for VSN systems. Unlike traditional attribute-based encryption methods used in data management, our approach introduces a group-grained model that enables fine-grained control over search rights and data-sharing isolation, ensuring enhanced data privacy. Additionally, to reduce the computational burden on these Internet of Thing (IoT) devices, our scheme ensures constant-sized keyword index generation, data index generation, trapdoor creation, and decryption processes. We evaluate the efficiency of our construction and compare it with similar constructions. The results demonstrate that our construction is well suited for resource-constrained IoT devices in VSN systems.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (7) , 7793-7808
Group-Grained Data Search and Sharing With Privacy Protection for Vehicular Social Networks
Vehicular social networks (VSNs) play a crucial role in intelligent transportation systems, offering high-quality data management services that enhance various aspects of daily life. Due to their convenience, VSN systems, equipped with advanced data search and sharing capabilities, are increasingly integrated into modern vehicles. While earlier VSNs focused on securing data communication between users, the transmission of sensitive vehicle and traffic data, like road conditions and vehicle trajectories, has raised privacy concerns and the risk of data leakage, which could harm vehicle owners’ interests. Historically, these systems focused primarily on securing data communication between VSN users. However, the transmission of sensitive vehicle and traffic data, such as road conditions and vehicle trajectory information, has raised concerns about data privacy and the potential risks of data leakage, which could compromise the interests of vehicle owners. To address these challenges, we propose a novel group-grained data search and sharing scheme for VSN systems. Unlike traditional attribute-based encryption methods used in data management, our approach introduces a group-grained model that enables fine-grained control over search rights and data-sharing isolation, ensuring enhanced data privacy. Additionally, to reduce the computational burden on these Internet of Thing (IoT) devices, our scheme ensures constant-sized keyword index generation, data index generation, trapdoor creation, and decryption processes. We evaluate the efficiency of our construction and compare it with similar constructions. The results demonstrate that our construction is well suited for resource-constrained IoT devices in VSN systems.