Demo Data from EDBT 2026 / reviewers in the wild / expert
Gang He 0005
dblp:96/3183-5
· DBLP profile ↗
6ranked-venue papers
2as first author
6since 2021 · last 2027
0000-0001-5397-6259ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Security and privacy of machine learning · 61% Cryptographic protocols and secure computation · 39% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning › adversarial defense
adversarial example detection |
0.8 | 1 | 2024 | PPNNI: Privacy-Preserving Neural Network Inference Against Adversarial Example Attack · IEEE Trans. Serv. Comput. 2024 |
Security and privacy of machine learning
privacy-preserving inference |
0.8 | 1 | 2024 | PPNNI: Privacy-Preserving Neural Network Inference Against Adversarial Example Attack · IEEE Trans. Serv. Comput. 2024 |
Cryptographic protocols and secure computation › secure inference
secure neural network inference |
0.8 | 1 | 2024 | PPNNI: Privacy-Preserving Neural Network Inference Against Adversarial Example Attack · IEEE Trans. Serv. Comput. 2024 |
Cryptographic protocols and secure computation › secure multiparty computation
additive secret sharing |
0.2 | 1 | 2024 | PPNNI: Privacy-Preserving Neural Network Inference Against Adversarial Example Attack · IEEE Trans. Serv. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
uncertainty estimation · 0.8kernel density estimation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2027 | Privacy-Preserving transformer inference with functional encryption for model-as-a-service
Gang He 0005, Yanli Ren, Mu Huang |
Expert Syst. Appl. | 1 |
| 2026 | Privacy-preserving federated graph neural network against poisoning attack
Guanghui He 0003, Yanli Ren, Gang He 0005, Guorui Feng, Xinpeng Zhang 0001 |
Signal Process. | 3 |
| 2026 | Privacy-Enhanced Federated Prompt Tuning Against Backdoor AttackabstractWith the rapid development of large language models, the fine-tuning of downstream tasks has become a key problem. As a new learning paradigm, prompt learning can greatly reduce the number of updated parameters and effectively reduce the communication cost in federated learning scenarios by freezing the pre-trained model and fine-tuning soft prompt parameters. However, for the federated prompt tuning, the local prompt usually contains the user's personal information, and the text input of the user are easily leaked through the aggregation directly on the server. Meanwhile, the soft prompt is vulnerable to poisoning attacks launched by malicious users (such as backdoor). For the above problems, this paper proposes a privacy-preserving federated prompt fine-tuning against poisoning attacks. Specifically, we use homomorphic encryption to ensure the confidentiality of local prompts, and aggregate prompts under ciphertext to generate global prompts. Secondly, the proposed mechanism of backdoor detection is used to judge whether the prompt contains backdoors to resist the malicious attacks in the form of ciphertext. Both local and global prompts are invisible to the server during the entire training process. Finally, theoretical analysis and experimental results show that the accuracy error between the plaintext domain and the ciphertext domain is controlled within 2%-5% under backdoor attack, which effectively enhances the robustness of the model. Guanghui He 0003, Yanli Ren, Gang He 0005, Guorui Feng, Xinpeng Zhang 0001 |
IEEE Trans. Cloud Comput. | 3 |
| 2024 | VMMP: Verifiable privacy-preserving multi-modal multi-task prediction
Mingyun Bian, Yanli Ren, Gang He 0005, Guorui Feng, Xinpeng Zhang 0001 |
Inf. Sci. | 3 |
| 2024 | PPNNI: Privacy-Preserving Neural Network Inference Against Adversarial Example AttackabstractOutsourced inference services have greatly promoted the popularization of deep learning, and neural network models can help users customize a series of personalized applications, e.g., face recognition, image classification, etc. However, untrustworthy service providers also bring a variety of security issues, such as data privacy, network model privacy, etc. Meanwhile, the malicious example will result in the output of model incorrectly. For the above concerns, this paper proposes a privacy-reserving neural network inference against adversarial example attack (PPNNI) under two non-colluding cloud servers, where a series of efficient security protocols are designed to realize private prediction based on the additive secret sharing protocol. In the semi-honest model, the servers implement the neural network's private inference in the context of an unknown input and network model. Moreover, in order to prevent malicious examples from affecting the model accuracy, we produce a method of kernel density estimation and uncertainty value in the last layer of the hidden layer to determine whether the input is adversarial examples in the domain of ciphertext. The proposed PPNNI protocol is the first effort to efficiently detect adversarial attack behaviors under the ciphertexts. The theoretical analysis illustrate that the protocol can guarantee the privacy of input data, model parameters and the inference result. The results of the experiments demonstrate that the model accuracy are about 89% and 83% respectively with malicious examples on MNIST and CIFAR10 in the domain of ciphertext and they are nearly same as 91% and 85% in the domain of plaintext, which shows the effectiveness of our protocol. Guanghui He 0003, Yanli Ren, Gang He 0005, Guorui Feng, Xinpeng Zhang 0001 |
IEEE Trans. Serv. Comput. | 3 |
| 2023 | Privacy-enhanced and non-interactive linear regression with dropout-resilience
Gang He 0005, Yanli Ren, Mingyun Bian, Guorui Feng, Xinpeng Zhang 0001 |
Inf. Sci. | 1 |