EDBT 2026 Demo / reviewers in the wild / expert
Huang Zeng
dblp:313/8221
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0001-7363-646XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 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
2 papers |
Privacy and data protection · 49% Security and privacy of machine learning · 36% Cryptographic protocols and secure computation · 16% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning › federated learning defense
byzantine-robust federated learning |
1.0 | 1 | 2026 | Publicly Auditable Federated Learning With Privacy and Byzantine Robustness · IEEE Trans. Dependable Secur. Comput. 2026 |
Security and privacy of machine learning
federated learning security |
1.0 | 1 | 2026 | Publicly Auditable Federated Learning With Privacy and Byzantine Robustness · IEEE Trans. Dependable Secur. Comput. 2026 |
Privacy and data protection
privacy-preserving machine learning |
1.0 | 1 | 2026 | Publicly Auditable Federated Learning With Privacy and Byzantine Robustness · IEEE Trans. Dependable Secur. Comput. 2026 |
Privacy and data protection
privacy-preserving computation |
0.9 | 1 | 2025 | Efficient and Privacy-Preserving Ride Matching Over Road Networks Against Malicious ORH Server · IEEE Trans. Inf. Forensics Secur. 2025 |
Privacy and data protection › location privacy
privacy-preserving ride matching |
0.9 | 1 | 2025 | Efficient and Privacy-Preserving Ride Matching Over Road Networks Against Malicious ORH Server · IEEE Trans. Inf. Forensics Secur. 2025 |
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation |
0.9 | 1 | 2025 | Efficient and Privacy-Preserving Ride Matching Over Road Networks Against Malicious ORH Server · IEEE Trans. Inf. Forensics Secur. 2025 |
Smart cities and intelligent transportation
ride-hailing |
0.3 | 1 | 2025 | Efficient and Privacy-Preserving Ride Matching Over Road Networks Against Malicious ORH Server · IEEE Trans. Inf. Forensics Secur. 2025 |
Methods — techniques the papers use, named apart from their topics
verification protocol · 1.7secure two-party computation · 1.7road network embedding · 1.7secure aggregation · 1.0byzantine robustness · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Publicly Auditable Federated Learning With Privacy and Byzantine Robustness
Huang Zeng, Anjia Yang, Jian Weng 0001, Min-Rong Chen, Fengjun Xiao, Zilin Liu, Yi Liu 0053 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2025 | Efficient and Privacy-Preserving Ride Matching Over Road Networks Against Malicious ORH ServerabstractOnline ride-hailing (ORH) services have become indispensable for our travel needs, offering the convenience of easily locating the nearest driver for riders through ride matching algorithms. However, existing ORH systems, such as Lyft and Didi, require users (both riders and drivers) to disclose their real-time location information during the matching process, thus giving rise to serious privacy concerns. Despite the proposal of various privacy-preserving ride-matching schemes, they remain insufficient in addressing potential malicious behaviors from the ORH server, such as colluding with designated drivers and deviation from computation protocols to interfere with the matching process. These behaviors lead to non-optimal matching results for riders. To address these issues, we present EMPRide, an efficient and privacy-preserving ride-matching scheme resistant to malicious ORH server. In EMPRide, we design an efficient and accurate computation of distances between users protocol, which integrates road network embedding and secure two-party computation. Additionally, we design a verification protocol that allows riders to verify the correctness of computed distances and matching results. Crucially, the communication overhead for riders in EMPRide remains constant, irrelevant to the number of available drivers. Our evaluation using real-world datasets demonstrates that EMPRide significantly outperforms existing solutions. Specifically, under identical conditions, in EMPRide, the computation speed on the ORH server is$19.22\times $faster and the communication cost is$8.08\times $less than state-of-the-art approaches. Moreover, riders experience a speed improvement of 4.84 orders of magnitude with$1.30\times $less communication, while drivers benefit from a 4.79 orders of magnitude speed increase with$1.45\times $less communication. Mingtian Zhang, Anjia Yang, Jian Weng 0001, Min-Rong Chen, Huang Zeng, Yi Liu 0053, Zhihua Xia |
IEEE Trans. Inf. Forensics Secur. | 5 |
| 2024 | Enabling Privacy-Preserving and Publicly Auditable Federated LearningabstractFederated learning (FL) has attracted widespread attention because it supports the joint training of models by multiple participants without moving private dataset. However, there are still many security issues in FL that deserve discussion. In this paper, we consider three major issues: 1) how to ensure that the training process can be publicly audited by any third party; 2) how to avoid the influence of malicious participants on training; 3) how to ensure that private gradients and models are not leaked to third parties. Many solutions have been proposed to address these issues, while solving the above three problems simultaneously is seldom considered. In this paper, we propose a publicly auditable and privacy-preserving federated learning scheme that is resistant to malicious participants uploading gradients with wrong directions and enables anyone to audit and verify the correctness of the training process. In particular, we design a robust aggregation algorithm capable of detecting gradients with wrong directions from malicious participants. Then, we design a random vector generation algorithm and combine it with zero sharing and blockchain technologies to make the joint training process publicly auditable, meaning anyone can verify the correctness of the training. Finally, we conduct a series of experiments, and the experimental results show that the model generated by the protocol is comparable in accuracy to the original FL approach while keeping security advantages. Huang Zeng, Anjia Yang, Jian Weng 0001, Min-Rong Chen, Fengjun Xiao, Yi Liu 0053, Ye Yao 0003 |
ICC | 1 |