Pengbin Feng

Pengbin Feng

Auto-generated profile, based on publicly available information

Pengbin Feng

School of Cyber Engineering, Xidian University, Xian, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2024
Verified
Conference Paper
Open access
XHXu He
Xu He
SWShu Wang
Shu Wang
PFPengbin Feng
Pengbin Feng
Xinda WangXinda Wang
Xinda Wang
SSShiyu Sun
Shiyu Sun
KSKun Sun
Kun Sun
A timely software update is vital to combat the increasing security vulnerabilities. However, some software vendors may secretly patch their vulnerabilities without creating CVE entries or even describing the security issue in their change log. Thus, it is critical to identify these hidden security patches and defeat potential N-day attacks. Researchers have employed various machine learning techniques to identify security patches in open-source software, leveraging the syntax and semantic features of the software changes and commit messages. However, all these solutions cannot be directly applied to the binary code, whose instructions and program flow may dramatically vary due to different compilation configurations. In this paper, we propose BinGo, a new security patch detection system for binary code. The main idea is to present the binary code as code property graphs to enable a comprehensive understanding of program flow and perform a language model over each basic block of binary code to catch the instruction semantics. BinGo consists of four phases, namely, patch data pre-processing, graph extraction, embedding generation, and graph representation learning. Due to the lack of an existing binary security patch dataset, we construct such a dataset by compiling the pre-patch and post-patch source code of the Linux kernel. Our experimental results show BinGo can achieve up to 80.77% accuracy in identifying security patches between two neighboring versions of binary code. Moreover, BinGo can effectively reduce the false positives and false negatives caused by the different compilers and optimization levels.

16 August 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
Ning XiNing Xi
Ning Xi
YZYuchen Zhang
Yuchen Zhang
PFPengbin Feng
Pengbin Feng
SMSiqi Ma
Siqi Ma
JMJianfeng Ma
Jianfeng Ma
YYYale Yang
Yale Yang
With the rapid development of mobile apps, developers tend to implement a variety of functionalities to support users' demands. Thus, they involve the usage of native libraries to fulfill the luxuriant functionalities and maintain fast system responses, instead of using a unitary programming language (i.e., Java). Nonetheless, such an inter-language programming framework also introduces more security issues because attackers can conceal malicious behaviors at the native level to evade Android security vetting. Existing state-of-the-art detection tools mainly rely on the information extracted in the Java code to infer the potential malicious behaviors implemented in native code. None of them could simultaneously study the correlated behaviors in Java and native code. Therefore, in this paper, we proposed a static semantic-driven malware detection tool, GNNDroid , to distinguish malware by combining the behaviors implemented in both Java and native code. First, GNNDroid separately analyzes Java and native code to construct Java function call graphs and native function call graphs. It then utilizes a regex-based function recognition approach to explore the correlations between Java code and native code. According to the code correlations, GNNDroid constructs Multi-Relational Directed Graphs (MRDGs) to extract the comprehensive behaviors. Finally, it executes a Gated Graph Neural Network (GGNN) to analyze the MRDGs and distinguish malicious apps. We assessed GNNDroid by analyzing 40,000 Android apps and compared them with state-of-the-art tools. The result demonstrated that GNNDroid not only performs well when analyzing Java+native apps (i.e., apps implemented by both Java and native code), achieving an F1 of 98.57% but also effectively exploits Java only apps (i.e., apps implemented by Java code), achieving an F1 of 96.31%.

1 June 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
PFPengbin Feng
Pengbin Feng
Ning XiNing Xi
Ning Xi
JJJiong Jin
Jiong Jin
JZJun Zhang
Jun Zhang
JMJianfeng Ma
Jianfeng Ma

15 July 2025 in Computers & Security
Verified
Journal Article
Closed access
ZJZhizhuang Jia
Zhizhuang Jia
CYChao Yang
Chao Yang
PFPengbin Feng
Pengbin Feng
XZXiaoyun Zhao
Xiaoyun Zhao
XLXinghua Li
Xinghua Li
JMJianfeng Ma
Jianfeng Ma

18 August 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
ASAnyuan Sang
Anyuan Sang
YWYuchen Wang
Yuchen Wang
JJJunbo Jia
Junbo Jia
LYLi Yang
Li Yang
PFPengbin Feng
Pengbin Feng
JMJianfeng Ma
Jianfeng Ma
Advanced Persistent Threats (APTs) pose significant security risks to the community. Researchers thereby propose techniques to capture the complex and stealthy scenarios of APT attacks through the use of provenance graphs to model system entities and their dependencies. Particularly, to mitigate the dependency explosion problem in attack investigation using provenance graphs, tag-based and priority-based provenance graphs are frequently utilized for analyzing attacks. These methods use threat tag propagation and threat prioritization to reduce the size of the provenance graph for faster analysis. Unfortunately, these methods can allow more complex and potential attacks to evade detection. To overcome these difficulties, we propose an APT attack investigation system, ProTaging, for APT detection and forensic analysis. By using Tactics, Techniques, and Procedures (TTPs) rules to assign and update the node's threat tag, splittable tag propagation to control the scope of threat information, and threat weight aggregation and prioritized backward analysis during the forensic analysis phase, ProTaging effectively reconstructs attack paths in seconds without dependency explosion. Experimental results on both the simulation dataset, DARPA TC E3, E5 dataset, and DARPA OpTC dataset demonstrate that ProTaging generates smaller dependency graphs (2.5 times smaller) and has fewer false positives (6.7 times fewer) compared to state-of-the-art solutions. Additionally, ProTaging significantly reduces manual investigation effort by approximately 99.9%.

17 February 2025
Verified
Book Chapter
Closed access
PDF file
JZJunying Zhang
Junying Zhang
YXYiwen Xia
Yiwen Xia
XMXindi Ma
Xindi Ma
QJQi Jiang
Qi Jiang
Ning XiNing Xi
Ning Xi
JMJianfeng Ma
Jianfeng Ma