VLDB 2026 Research / reviewers in the wild / expert
Yange Chen
dblp:130/0340
· DBLP profile ↗
15ranked-venue papers
6as first author
15since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 6 · 3 first-author · 6 since 2021Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SecSGX: Fine-Grained Monitoring for Runtime Integrity Verification in SGX
Qingdi Han, Xiaoqi Zhao 0002, Haipeng Qu, Gaige Wang, Siqi Lu, Yange Chen |
ICIC (11) | 6 |
| 2025 | A Verifiable Privacy-Preserving Federated Learning Framework Against Collusion AttacksabstractMost of the current federated learning schemes aimed at safeguarding privacy exhibit vulnerability to collusion attacks and lack a verification mechanism for participants to consolidate the aggregation results of the parameter server, leading to privacy breaches for users and inaccurate model training outcomes. In order to address these issues, we propose a verifiable privacy-preserving federated learning framework against collusion attacks. Primarily, the federated learning scheme is reconfigured utilizing the ElGamal encryption algorithm, which effectively safeguards the data privacy of participants in scenarios involving collusion between certain participants and servers. Additionally, the introduction of the assistant server can realize the joint decryption of the gradient ciphertext by the non-collusive parameter server and assistant server, which can effectively resist the internal attack of a single parameter server model in the process of data upload. Third, this scheme designs a verification mechanism that enables participants to effectively verify the accuracy and integrality of the parameter server's aggregated results, preventing the parameter server from returning incorrect aggregation results to participants. Experimental results and performance analysis demonstrate that our proposed scheme not only fortifies security measures but also upholds the precision of model training, surpassing the security and correctness of many existing methodologies. Yange Chen, SuYu He, Baocang Wang, Zhanshen Feng, Zhihong Tian 0001 |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | Privacy-preserving data integration scheme in industrial robot system based on fog computing and edge computingabstractAbstract To solve the security problems of the moving robot system in the fog network of the Industrial Internet of Things (IIoT), this paper presents a privacy‐preserving data integration scheme in the moving robot system. First, a novel data collection enhancement algorithm is proposed to enhance the image effects, and a k ‐anonymous location and data privacy protection protocol based on Ad hoc network (Ad hoc‐based KLDPP protocol) is designed in secure data collection phase to protect the privacy of location and network data. Second, the secure multiparty computation with verifiable key sharing is introduced to realize the valid computation against share cheating in the robot system. Third, the ciphertext classification method in a neural network is considered in the secure data storage process to realize the special application. Finally, experiments and simulations are conducted on the robot system of fog computing in the IIoT. The results demonstrate that the proposed scheme can improve the security and efficiency of the said robot system. Amirhosein Taherkordi, Dapeng Lan, Yange Chen |
IET Commun. | 5 |
| 2024 | Verifiable Privacy-Preserving Federated Learning Under Multiple Encrypted KeysabstractFederated learning is a distributed learning helpful approach for resolving data privacy concerns and eliminating data silos. Homomorphic encryption is a vital technology for preserving user privacy in federated learning, and current studies are mainly concentrated on a single-key environment. However, if one user key is exposed in a single-key environment, it implies that the whole system key has been revealed. To strengthen security, we should allow different participants of federated learning to choose different keys to encrypt their local models. The cloud server should finish model aggregation calculation on ciphertexts under different public keys. Besides, research in this area is insufficient to guarantee mobile users’ data integrity verification and authentication in open channels. Therefore, this article proposes a privacy protection federated learning scheme VPFL based on the BCP cryptosystem, which can verify user identity and data integrity in a multikey environment. First, this scheme employs the BCP cryptosystem with double trapdoors for data encryption and transmission, enhancing the user’s privacy security. Second, a method for verifying user data integrity and identity was created utilizing bilinear aggregate signatures and verifiable secret sharing. It can effectively eliminate some incorrect data of some users. Third, VPFL tolerates users dropping out during training while still guaranteeing high accuracy. Finally, theoretical analysis and experimental evaluation indicate that the proposed scheme is efficient and secure. Xiaoying Shen, Baocang Wang, Yange Chen, Dianhua Tang |
IEEE Internet Things J. | 5 |
| 2024 | A Privacy-Preserving Federated Learning Framework With Lightweight and Fair in IoTabstractFederated learning offers a partial safeguard for participants’ data privacy. Nevertheless, the current absence of an efficient privacy-preserving federated learning technology tailored for the Internet of Things (IoT) poses a challenge. Numerous privacy-preserving federated learning frameworks have been proposed, primarily relying on homomorphic cryptosystems, yet their suitability for IoT remains limited. Furthermore, the application of federated learning in IoT confronts two significant obstacles: mitigating the substantial communication costs and communication failure rates, and effectively discerning and utilizing high-quality data while discarding low-quality data for collaborative modeling purposes. In order to address these challenges, this paper introduces a privacy-preserving optimal aggregation federated learning framework that relies on the utilization of the multi-key EC-ElGamal cryptosystem (MEEC) and the federated sum optimization algorithm (FSOA), which are characterized by their lightweight nature and fair properties. The proposed MEEC approach aims to tackle the issue of multi-key collaborative computing within the context of federated learning, thereby resulting in reduced communication costs and enhanced communication efficiency. This is achieved through the leverage of the EC-ElGamal cryptosystem, which is known for its ability to generate short keys and ciphertexts. Furthermore, this paper presents a dynamic federated learning framework that incorporates user dynamic quit and join algorithms. The primary objective of this framework is to mitigate the adverse effects of communication failures and enhance power computation on IoT devices. Additionally, an FSOA is devised to ensure the acquisition of optimal training data, thereby preventing the inclusion of low-quality data in the training process. Subsequently, the proposed scheme undergoes rigorous security analysis and performance evaluation. The obtained results unequivocally demonstrate that our scheme outperforms existing solutions in terms of security, practicality, and efficiency with lower communication and computational costs. Yange Chen, Lei Liu 0031, Yuan Ping 0003, Mohammed Atiquzzaman, Shahid Mumtaz, Mohsen Guizani, Zhihong Tian 0001 |
IEEE Trans. Netw. Serv. Manag. | 1 |
| 2024 | Privacy-Preserving Convolutional Neural Network Classification Scheme With Multiple KeysabstractConvolutional Neural Networks (CNNs) possess extensive applicability across diverse domains, particularly in the realm of image recognition. In light of the advent of machine learning as a service, the utilization of a well-trained CNN model by servers to execute image classification based on user queries has become a significant service, catering to a wide array of applications. Nevertheless, this convenience is accompanied by the inherent risk of data privacy and model privacy disclosure, which can have severe ramifications, particularly in the context of specialized scenarios like medical images and location images. Hence, how to perform classification for CNN with privacy protection emerges as a crucial research concern. Furthermore, the nonlinearity of CNN's activation function renders it unsuitable for homomorphic cryptosystems. In order to address these challenges, we put forth a privacy-preserving CNN classification scheme employing a distributed two trapdoors public-key cryptosystem (DT-PKC). Initially, we introduce a security protocol toolkit encompassing protocols for secure multiplication, secure activation function computing, and average pooling. In addition, we propose a novel continuous and derivative Tanhplus function as an approximation of the Relu function, aiming to enhance the accuracy of classification results. The secure activation function computing protocol utilizes the aforementioned Tanhplus function in conjunction with the proposed homogenization algorithm to compute the activation function. This protocol guarantees more precise and accurate output in the activation function calculation of CNN when operating under ciphertext. Furthermore, the adoption of the DT-PKC cryptosystem not only ensures privacy protection for CNN classification but also provides support for lightweight users and multiple keys. Finally, security analysis and performance evaluations demonstrate that the proposed scheme is secure, practicable, and efficient with high accuracy. Baocang Wang, Yange Chen, Furong Li 0003, Jian Song 0024, Rongxing Lu, Pu Duan, Zhihong Tian 0001 |
IEEE Trans. Serv. Comput. | 2 |
| 2023 | PPeFL: Privacy-Preserving Edge Federated Learning With Local Differential PrivacyabstractSince traditional federated learning (FL) algorithms cannot provide sufficient privacy guarantees, an increasing number of approaches apply local differential privacy (LDP) techniques to FL to provide strict privacy guarantees. However, the privacy budget heavily increases proportionally with the dimension of the parameters, and the large variance generated by the perturbation mechanisms leads to poor performance of the final model. In this article, we propose a novel privacy-preserving edge FL framework based on LDP (PPeFL). Specifically, we present three LDP mechanisms to address the privacy problems in the FL process. The proposed filtering and screening with exponential mechanism (FS-EM) filters out the better parameters for global aggregation based on the contribution of weight parameters to the neural network. Thus, we can not only solve the problem of fast growth of privacy budget when applying perturbation mechanism locally but also greatly reduce the communication costs. In addition, the proposed data perturbation mechanism with stronger privacy (DPM-SP) allows a secondary scrambling of the original data of participants and can provide strong security. Further, a data perturbation mechanism with enhanced utility (DPM-EU) is proposed in order to reduce the variance introduced by the perturbation. Finally, extensive experiments are performed to illustrate that the PPeFL scheme is practical and efficient, providing stronger privacy protection while ensuring utility. Baocang Wang, Yange Chen, Zhen Zhao 0005 |
IEEE Internet Things J. | 2 |
| 2023 | Privacy-preserving multi-party deep learning based on homomorphic proxy re-encryption
Xiaoying Shen, Baocang Wang, Yange Chen, Dianhua Tang |
J. Syst. Archit. | 5 |
| 2022 | Verifiable privacy-preserving association rule mining using distributed decryption mechanism on the cloud
Yange Chen, Pu Duan, Benyu Zhang, Zhiyong Hong, Baocang Wang |
Expert Syst. Appl. | 1 |
| 2022 | Privacy-preserving convolutional neural network prediction with low latency and lightweight usersabstractConvolutional neural networks (CNNs) have excellent and extensive applications in image recognition. With the continuous exploitation of data value and the proliferation of machine learning-as-a-service, convolutional neural network prediction schemes on privacy preservation have been introduced one after another, which makes much more attention focused on the privacy leakage and services offered to be efficient and light. Therefore, how to improve the convolutional neural prediction scheme on the premise of privacy preservation turns out to be an imperative research issue. In this paper, we propose a privacy-preserving convolutional neural network prediction scheme (PCP-LL) that supports low latency and lightweight users. The scheme starts from the perspective of lossless accuracy from underlying networks. First, we construct a secure activation function computing protocol (SActF) utilizing a commodity-based secure comparison protocol, which reduces the complexity and latency during the activation function computing under ciphertexts compared with common schemes. Second, to further support lightweight users, we introduce a secure output layer protocol (SOut) that enables users to obtain the prediction results without extra decryption after simple operations. Then, the scheme adopts the distributed two trapdoors public-key cryptosystem (DT-PKC) to achieve both data and model security, which well avoids security issues especially such as wiretapping by semi-honest participants commonly in secret sharing schemes. Finally, through relevant evaluations, the scheme not only achieves privacy preservation and low latency, but also supports lightweight users. Furong Li 0003, Yange Chen, Pu Duan, Benyu Zhang, Zhiyong Hong, Yupu Hu, Baocang Wang |
Int. J. Intell. Syst. | 2 |
| 2022 | Cryptanalysis and Improvement of DeepPAR: Privacy-Preserving and Asynchronous Deep Learning for Industrial IoTabstractIndustrial Internet of Things (IIoT) is gradually changing the mode of traditional industries with the rapid development of big data. Besides, thanks to the development of deep learning, it can be used to extract useful knowledge from the large amount of data in the IIoT to help improve production and service quality. However, the lack of large-scale data sets will lead to low performance and overfitting of learning models. Therefore, federated deep learning with distributed data sets has been proposed. Nevertheless, the research has shown that federated learning can also leak the private data of participants. In IIoT, once the privacy of participants in some special application scenarios is leaked, it will directly affect national security and people’s lives, such as smart power grid and smart medical care. At present, several privacy-preserving federated learning schemes have been proposed to preserve data privacy of participants, but security issues prevent them from being fully applied. In this article, we analyze the security of the DeepPAR scheme proposed by Zhang et al., and point out that the scheme is insecure in the re-encryption key generation process, which will cause the leakage of the secret key of participants or the proxy server. In addition, the scheme is not resistant to collusion attacks between the parameter server and participants. Based on this, we propose an improved scheme. The security proof shows that the improved scheme solves the security problem of the original scheme and is resistant to collusion attacks. Finally, the security and accuracy of the scheme is illustrated by performance analysis. Yange Chen, SuYu He, Baocang Wang, Pu Duan, Benyu Zhang, Zhiyong Hong, Yuan Ping 0003 |
IEEE Internet Things J. | 1 |
| 2022 | Toward practical privacy-preserving linear regression
Wenju Xu, Baocang Wang, Jiasen Liu, Yange Chen, Pu Duan, Zhiyong Hong |
Inf. Sci. | 4 |
| 2022 | Privacy-Preserving Multi-Class Support Vector Machine Model on Medical DiagnosisabstractWith the rapid development of machine learning in the medical cloud system, cloud-assisted medical computing provides a concrete platform for remote rapid medical diagnosis services. Support vector machine (SVM), as one of the important algorithms of machine learning, has been widely used in the field of medical diagnosis for its high classification accuracy and efficiency. In some existing schemes, healthcare providers train diagnostic models with SVM algorithms and provide online diagnostic services to doctors. Doctors send the patient's case report to the diagnostic models to obtain the results and assist in clinical diagnosis. However, case report involves patients' privacy, and patients do not want their sensitive information to be leaked. Therefore, the protection of patient's privacy has become an important research direction in the field of online medical diagnosis. In this paper, we propose a privacy-preserving medical diagnosis scheme based on multi-class SVMs. The scheme is based on the distributed two trapdoors public key cryptosystem (DT-PKC) and Boneh-Goh-Nissim (BGN) cryptosystem. We design a secure computing protocol to compute the core process of the SVM classification algorithm. Our scheme can deal with both linearly separable data and nonlinear data while protecting the privacy of user data and support vectors. The results show that our scheme is secure, reliable, scalable with high accuracy. Yange Chen, Qinyu Mao, Baocang Wang, Pu Duan, Benyu Zhang, Zhiyong Hong |
IEEE J. Biomed. Health Informatics | 1 |
| 2021 | Privacy-preserving image multi-classification deep learning model in robot system of industrial IoT
Yange Chen, Yuan Ping 0003, Baocang Wang, SuYu He |
Neural Comput. Appl. | 1 |
| 2021 | Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate PolynomialsabstractPrivate information retrieval (PIR) protocol is a powerful cryptographic tool and has received considerable attention in recent years as it can not only help users to retrieve the needed data from database servers but also protect them from being known by the servers. Although many PIR protocols have been proposed, it remains an open problem to design an efficient PIR protocol whose communication overhead is irrelevant to the database size N . In this paper, to answer this open problem, we present a new communication-efficient PIR protocol based on our proposed single-ciphertext fully homomorphic encryption (FHE) scheme, which supports unlimited computations with single variable over a single ciphertext even without access to the secret key. Specifically, our proposed PIR protocol is characterized by combining our single-ciphertext FHE with Lagrange interpolating polynomial technique to achieve better communication efficiency. Security analyses show that the proposed PIR protocol can efficiently protect the privacy of the user and the data in the database. In addition, both theoretical analyses and experimental evaluations are conducted, and the results indicate that our proposed PIR protocol is also more efficient and practical than previously reported ones. To the best of our knowledge, our proposed protocol is the first PIR protocol achieving O1 communication efficiency on the user side, irrelevant to the database size N . Wenju Xu, Baocang Wang, Rongxing Lu, Quanbo Qu, Yange Chen, Yupu Hu |
Secur. Commun. Networks | 5 |