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

Zhenghe Wang

dblp:123/8255 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1Software engineering, systems software and programming languages · 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
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 77% Operating systems · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › vulnerability management › patch management
patch detection
0.412020
PDiff: Semantic-based Patch Presence Testing for Downstream Kernels · CCS 2020
Systems and software security
vulnerability analysis
0.412020
PDiff: Semantic-based Patch Presence Testing for Downstream Kernels · CCS 2020
Software maintenance and evolution › software updates
patch management
0.412020
PDiff: Semantic-based Patch Presence Testing for Downstream Kernels · CCS 2020
Operating systems
kernel
0.112020
PDiff: Semantic-based Patch Presence Testing for Downstream Kernels · CCS 2020

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

semantic analysis · 0.9code signature matching · 0.9
YearPublicationVenuePosition
2026 Feistel-PUF: Sequential Obfuscation-Based Machine Learning Attack-Resistant Physical Unclonable Function for IoT Device Security Authentication
abstract
Device authentication protocols based on a strong physical unclonable function (PUF) show promise for enhancing Internet of Things security. However, a strong PUF is vulnerable to machine learning (ML) attacks. This paper proposes a Feistel structure sequential obfuscation-based PUF (Feistel-PUF) to resist ML attacks. When the PUF is obfuscated by the Feistel structure, the challenge-response relationship resembles that of sequential logic circuits. Specifically, each response depends on both current and historical challenges, thereby significantly increasing the complexity of the challenge-response mapping. Experimental results showed that even with 1 million collected challenge response pairs, the prediction accuracies of ML attacks on Feistel-PUF remained at approximately 50%. Notably, the obfuscation process excluded response data, thereby preserving the randomness, reliability, and uniqueness of PUF with negligible performance degradation. The Feistel structure was iteratively reused for sequential obfuscation processing, maintaining constant and minimal hardware overhead. We propose a novel approach that combines the Feistel-PUF with an authentication protocol. This system synchronizes obfuscation parameters during the initial registration phase and implements dynamic updates throughout the authentication process. This approach allows the obfuscation structure to be made public, thereby overcoming the reliance on structure or algorithm secrecy in traditional dynamic challenge obfuscation schemes. The security of the protocol was confirmed by subjecting it to ProVerif verification and security analysis.
Gang Li 0038, Liangxiao Zhao, Ziyu Zhou 0001, Pengjun Wang, Xuejiao Ma, Yuejun Zhang, Zhenghe Wang
IEEE Internet Things J.7
2025 AePPollo: Automated Exploit Generation for Prototype Pollution Vulnerabilities in Node.js Application
abstract
Prototype pollution is a kind of severe vulnerability in Node.js that enables unauthorized modification of object prototypes, leading to critical security risks.Although prior work has focused on detecting and assessing the severity of prototype pollution, automated and efficient exploit generation for server-side scenarios remains unaddressed.To bridge this gap, we develop AePPollo 1 , a framework that integrates taint analysis, knowledge-enhanced Large Language Models (LLMs), and fuzzing to automatically generate exploits for Node.jsprototype pollution.Evaluated on 218 real-world prototype pollution vulnerabilities, AePPollo achieves a 91.74% exploit generation success rate with minimal overhead, outperforming state-of-theart methods.
Wenya Wang 0003, Zhenghe Wang, Sicong Cao, Xingwei Lin, Dawu Gu
SEKE3
2020 PDiff: Semantic-based Patch Presence Testing for Downstream Kernels
abstract
Open-source kernels have been adopted by massive downstream vendors on billions of devices. However, these vendors often omit or delay the adoption of patches released in the mainstream version. Even worse, many vendors are not publicizing the patching progress or even disclosing misleading information. However, patching status is critical for groups (e.g., governments and enterprise users) that are keen to security threats. Such a practice motivates the need for reliable patch presence testing for downstream kernels. Currently, the best means of patch presence testing is to examine the existence of a patch in the target kernel by using the code signature match. However, such an approach cannot address the key challenges in practice. Specifically, downstream vendors widely customize the mainstream code and use non-standard building configurations, which often change the code around the patching sites such that the code signatures are ineffective.
Zheyue Jiang, Yuan Zhang 0009, Jun Xu 0024, Zhenghe Wang, Xiaohan Zhang 0001, Xinyu Xing 0001, Min Yang 0002, Zhemin Yang
CCS5