Zhonghai Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zhonghai Wu has a total of 188 co-authors. Here are the top co-authors by number of shared publications:
- Hongzhi Liu
School of Software and Microelectronics, Peking University, Beijing, China
20 shared publications - Qingni Shen
Peking University
20 shared publications - Ying Li
National Engineering Research Center for Software Engineering, Peking University, Beijing, China and Beijing Key Laboratory of Data Intelligence and Security, Peking University, Beijing, China
13 shared publications - Tong Jia
Peking University, Beijing, China
9 shared publications - Cong Li
Peking University
7 shared publications - Lingzhe Zhang
Peking University, Beijing, China
6 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4028-4037
HalluScope: Fine-grained Hallucination Diagnosis for Multimodal Large Language Models
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4028-4037
Open AccessHalluScope: Fine-grained Hallucination Diagnosis for Multimodal Large Language Models
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4510-4521
Multi-dimensional Evolution Model with Attribute and Structure Interactions for Entity Alignment
Entity alignment aims to identify equivalent entities across different Knowledge Graphs (KGs), serving as a fundamental task for knowledge graph integration. It is inherently a multi-dimensional problem, where graph topology, entity attributes, and alignment evidence should mutually reinforce one another. However, most existing methods fail to establish such a loop. They typically expand or refine alignment supervision alone, while keeping the underlying graph structure and attribute importance static. Moreover, they lack a global view of which attributes are discriminative across the alignment set. As a result, structural sparsity persists, noisy attributes cannot be suppressed, and alignment supervision remains scarce. To solve these problems, we propose MEASI, a Multi-dimensional Evolution model with Attribute and Structure Interactions for entity alignment. MEASI comprises three evolutionary modules that establish a self-reinforcing loop. First, a Graph Structure Evolution (GSE) module progressively enhances graph topology by leveraging newly discovered alignments. Second, a Global Attribute Weight Evolution (GAWE) module iteratively updates global attribute weights via alignment feedback, emphasizing discriminative attributes and reducing the influence of attribute noise. Finally, an Alignment Signal Evolution (ASE) module continuously discovers new aligned entities from both structural and attribute views to fuel the next iteration of GSE and GAWE, compensating for limited pre-aligned entities. Extensive experiments show that MEASI outperforms state-of-the-art methods.
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4510-4521
Open AccessMulti-dimensional Evolution Model with Attribute and Structure Interactions for Entity Alignment
Entity alignment aims to identify equivalent entities across different Knowledge Graphs (KGs), serving as a fundamental task for knowledge graph integration. It is inherently a multi-dimensional problem, where graph topology, entity attributes, and alignment evidence should mutually reinforce one another. However, most existing methods fail to establish such a loop. They typically expand or refine alignment supervision alone, while keeping the underlying graph structure and attribute importance static. Moreover, they lack a global view of which attributes are discriminative across the alignment set. As a result, structural sparsity persists, noisy attributes cannot be suppressed, and alignment supervision remains scarce. To solve these problems, we propose MEASI, a Multi-dimensional Evolution model with Attribute and Structure Interactions for entity alignment. MEASI comprises three evolutionary modules that establish a self-reinforcing loop. First, a Graph Structure Evolution (GSE) module progressively enhances graph topology by leveraging newly discovered alignments. Second, a Global Attribute Weight Evolution (GAWE) module iteratively updates global attribute weights via alignment feedback, emphasizing discriminative attributes and reducing the influence of attribute noise. Finally, an Alignment Signal Evolution (ASE) module continuously discovers new aligned entities from both structural and attribute views to fuel the next iteration of GSE and GAWE, compensating for limited pre-aligned entities. Extensive experiments show that MEASI outperforms state-of-the-art methods.
- 26 September 2026
- Published by Springer Nature
- p. 15-31
DAPU: Dynamic Attribute and Policy Updating Attribute-Based Access Control for Cloud Data Sharing
- 26 September 2026
- Published by Springer Nature
- p. 15-31
DAPU: Dynamic Attribute and Policy Updating Attribute-Based Access Control for Cloud Data Sharing
- 26 September 2026
- Published by Springer Nature
- p. 572-588
Efficient Revocable Identity-Based Inner Product Functional Encryption Based on SM9
- 26 September 2026
- Published by Springer Nature
- p. 572-588
Efficient Revocable Identity-Based Inner Product Functional Encryption Based on SM9
- 7 September 2026
- Published by Springer Nature
- p. 233-251
Reinforcement Learning-Based Adaptive Ensemble for Sequential Recommendation
- 7 September 2026
- Published by Springer Nature
- p. 233-251
Reinforcement Learning-Based Adaptive Ensemble for Sequential Recommendation
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23  (5) , 11051-11068
Casbin: A Graph-Based Approach for Efficient and Verifiable Cloud Authorization
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23  (5) , 11051-11068
Casbin: A Graph-Based Approach for Efficient and Verifiable Cloud Authorization
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2533-2543
Hypergraph Diffusion-Based Sequential Ensemble for CTR Prediction
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2533-2543
Open AccessHypergraph Diffusion-Based Sequential Ensemble for CTR Prediction
- 10 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP  (15455971) , 1-17
Identity-Based Encryption with Equality Test and Flexible Time-Based Authorization for Cloud Computing
Identity-based encryption with equality test (IBEET) extends identity-based encryption to support the comparison between messages in two distinct ciphertexts associated with different identities. Nevertheless, nearly all of the previous IBEET schemes have the problem that once the trapdoor is sent to the cloud server, it becomes uncontrollable. Meanwhile, the only existing IBEET scheme coping with this problem, namely IBEET with datestamp-based authorization (IBEET-DBA), suffers from the following flaws. (1) A trapdoor merely expresses a single time interval, which is inexpressive. (2) It is inflexible due to only supporting limited types of authorization. (3) It is merely proven secure in the random oracle model, which has been pointed out that it may lead to security risks in practicality. Considering the aforementioned problems, we propose an IBEET with flexible time-based authorization (IBEET-FTBA) scheme, supporting wildcards and putting no constraint on authorization types. We prove our scheme secure against adaptive chosen-ciphertext attacks in the standard model. Subsequently, we give a detailed theoretical analysis of our IBEET-FTBA construction and the main existing IBEET ones. Furthermore, we implement ours and the IBEET-DBA construction as a benchmark, and conduct numerous experiments. Both results demonstrate that ours has better performance in the scenario of multiple time intervals.
- 10 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP  (15455971) , 1-17
Identity-Based Encryption with Equality Test and Flexible Time-Based Authorization for Cloud Computing
Identity-based encryption with equality test (IBEET) extends identity-based encryption to support the comparison between messages in two distinct ciphertexts associated with different identities. Nevertheless, nearly all of the previous IBEET schemes have the problem that once the trapdoor is sent to the cloud server, it becomes uncontrollable. Meanwhile, the only existing IBEET scheme coping with this problem, namely IBEET with datestamp-based authorization (IBEET-DBA), suffers from the following flaws. (1) A trapdoor merely expresses a single time interval, which is inexpressive. (2) It is inflexible due to only supporting limited types of authorization. (3) It is merely proven secure in the random oracle model, which has been pointed out that it may lead to security risks in practicality. Considering the aforementioned problems, we propose an IBEET with flexible time-based authorization (IBEET-FTBA) scheme, supporting wildcards and putting no constraint on authorization types. We prove our scheme secure against adaptive chosen-ciphertext attacks in the standard model. Subsequently, we give a detailed theoretical analysis of our IBEET-FTBA construction and the main existing IBEET ones. Furthermore, we implement ours and the IBEET-DBA construction as a benchmark, and conduct numerous experiments. Both results demonstrate that ours has better performance in the scenario of multiple time intervals.
- 16 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19  (3) , 2317-2328
NER-AD: Noise-Robust Reconstruction Enhanced by Representation-Learning for Metric Anomaly Detection in Online Service Systems
Online service systems operate under high concurrency, dynamic workloads, and distributed execution environments, which increase their susceptibility to faults and performance degradation. To ensure stable operation, these systems commonly monitor performance metrics, where timely anomaly detection enables early intervention and fault prevention. Existing metrics-based anomaly detection methods are typically unsupervised, reconstructing unlabeled data to model normal patterns and detecting anomalies as deviations from these patterns. However, they often overlook the presence of unlabeled anomalous data (noise) within the training set, which hinders the model's ability to accurately learn normal behavior and degrades detection accuracy. To address this limitation, we propose a noise-robust, representation-enhanced reconstruction-based anomaly detection method for metrics. The method trains a reconstruction model to capture normal time-series patterns and identifies noisy samples based on their deviation from the latent representation center, assigning them lower training weights. Both the reconstruction outputs and the representation centers jointly define the normal pattern of each sample, reducing the influence of anomalous noise during modeling. Extensive experiments show that our method achieves an F1 score of 97.00% on four widely used datasets, surpassing existing state-of-the-art approaches. Ablation studies further confirm the effectiveness of each module.
- 16 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19  (3) , 2317-2328
NER-AD: Noise-Robust Reconstruction Enhanced by Representation-Learning for Metric Anomaly Detection in Online Service Systems
Online service systems operate under high concurrency, dynamic workloads, and distributed execution environments, which increase their susceptibility to faults and performance degradation. To ensure stable operation, these systems commonly monitor performance metrics, where timely anomaly detection enables early intervention and fault prevention. Existing metrics-based anomaly detection methods are typically unsupervised, reconstructing unlabeled data to model normal patterns and detecting anomalies as deviations from these patterns. However, they often overlook the presence of unlabeled anomalous data (noise) within the training set, which hinders the model's ability to accurately learn normal behavior and degrades detection accuracy. To address this limitation, we propose a noise-robust, representation-enhanced reconstruction-based anomaly detection method for metrics. The method trains a reconstruction model to capture normal time-series patterns and identifies noisy samples based on their deviation from the latent representation center, assigning them lower training weights. Both the reconstruction outputs and the representation centers jointly define the normal pattern of each sample, reducing the influence of anomalous noise during modeling. Extensive experiments show that our method achieves an F1 score of 97.00% on four widely used datasets, surpassing existing state-of-the-art approaches. Ablation studies further confirm the effectiveness of each module.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5087-5098
FedSRD: Sparsify-Reconstruct-Decompose for Communication-Efficient Federated Large Language Models Fine-Tuning
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5087-5098
Open AccessFedSRD: Sparsify-Reconstruct-Decompose for Communication-Efficient Federated Large Language Models Fine-Tuning