Xinyu Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xinyu Tang has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Cheng Guo
Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province and the School of Software Technology, Dalian University of Technology, Dalian, China
6 shared publications - Kim-Kwang Raymond Choo
Department of Information Systems and Cybersecurity, The University of Texas at San Antonio, San Antonio, USA
4 shared publications - Yining Liu
Wenzhou University of Technology
3 shared publications - Qianqian He
School of Software, Dalian University of Technology, Dalian, China
2 shared publications Cheng Guo
1 shared publication- Kaoru Ota
Tohoku University
1 shared publication
Latest Publications
- 25 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 388-403
SSAA: Secure Semi-Asynchronous Aggregation for Decentralized Federated Learning on Heterogeneous Devices
Decentralized federated learning (DFL) has been widely used in edge computing and Internet of Things (IoT) settings with many devices. However, the heterogeneity of devices (e.g., varying computational capacity, stability, security requirements) can impact the performance of DFL applications. Our proposed SSAA, a secure aggregation scheme for DFL on heterogeneous devices, presented in this paper is designed to improve the efficiency of DFL while preserving privacy. Specifically, SSAA accelerates aggregation by synchronously coupling aggregation device-set formation with aggregation computation, and can cope with device availability and performance variability to maintain stable and efficient aggregation. By extending homomorphic encryption to support cross-round ciphertext continuity, SSAA enables reliable and secure decryption under large-scale dropouts in the original aggregation set, making it practical for dynamic DFL environments. In addition, we prove that SSAA is semi-honestly secure and resistant to device collusion attacks – fundamental security requirements for applications involving heterogeneous devices. We also implement SSAA and comprehensively evaluate its performance to demonstrate its practicability.
- 25 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 388-403
SSAA: Secure Semi-Asynchronous Aggregation for Decentralized Federated Learning on Heterogeneous Devices
Decentralized federated learning (DFL) has been widely used in edge computing and Internet of Things (IoT) settings with many devices. However, the heterogeneity of devices (e.g., varying computational capacity, stability, security requirements) can impact the performance of DFL applications. Our proposed SSAA, a secure aggregation scheme for DFL on heterogeneous devices, presented in this paper is designed to improve the efficiency of DFL while preserving privacy. Specifically, SSAA accelerates aggregation by synchronously coupling aggregation device-set formation with aggregation computation, and can cope with device availability and performance variability to maintain stable and efficient aggregation. By extending homomorphic encryption to support cross-round ciphertext continuity, SSAA enables reliable and secure decryption under large-scale dropouts in the original aggregation set, making it practical for dynamic DFL environments. In addition, we prove that SSAA is semi-honestly secure and resistant to device collusion attacks – fundamental security requirements for applications involving heterogeneous devices. We also implement SSAA and comprehensively evaluate its performance to demonstrate its practicability.
- 27 September 2025
- Published by Elsevier in Computer Networks
- Vol. 272
DSAFL:Decentralized secure aggregation with communication path optimization for cross-silo federated learning
- 27 September 2025
- Published by Elsevier in Computer Networks
- Vol. 272
DSAFL:Decentralized secure aggregation with communication path optimization for cross-silo federated learning
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 2663-2674
FedVKD: An Adaptive Virtual Data-Based Knowledge Distillation Framework for Heterogeneous Federated Learning
Federated learning (FL) has emerged as a pivotal distributed learning paradigm, demonstrating remarkable applicability in scenarios requiring privacy preservation and cross-silo data collaboration. However, the inherent data heterogeneity across clients induces significant model accuracy degradation and slow convergence, limiting the practical application of FL in real-world. While knowledge distillation (KD) shows promise, existing KD methods face critical limitations in privacy leakage and high computational overhead due to their reliance on public datasets or generative model. To overcome these limitations, we propose an adaptive Virtual data-based Knowledge Distillation framework for heterogeneous FL, termed FedVKD. Specifically, we innovatively introduce adaptive virtual data, which bypasses privacy information concerns while effectively mitigating distribution shift through a conditional distribution mismatch penalty. These Virtual data then facilitate per-class lightweight knowledge distillation with the integrated feature representations and the corresponding soft predictions, effectively transferring knowledge from the global model to local models. Notably, unlike other KD-based FL methods, FedVKD does not rely on public datasets or generative models. Moreover, FedVKD can be integrated as a plug-in module into existing FedAvg-based FL methods, enhancing their handling of data heterogeneity. Extensive experiments demonstrate that FedVKD consistently outperforms state-of-the-art methods, achieving up to 7.54% accuracy improvement and $2.58\times $ convergence speedup.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 2663-2674
FedVKD: An Adaptive Virtual Data-Based Knowledge Distillation Framework for Heterogeneous Federated Learning
Federated learning (FL) has emerged as a pivotal distributed learning paradigm, demonstrating remarkable applicability in scenarios requiring privacy preservation and cross-silo data collaboration. However, the inherent data heterogeneity across clients induces significant model accuracy degradation and slow convergence, limiting the practical application of FL in real-world. While knowledge distillation (KD) shows promise, existing KD methods face critical limitations in privacy leakage and high computational overhead due to their reliance on public datasets or generative model. To overcome these limitations, we propose an adaptive Virtual data-based Knowledge Distillation framework for heterogeneous FL, termed FedVKD. Specifically, we innovatively introduce adaptive virtual data, which bypasses privacy information concerns while effectively mitigating distribution shift through a conditional distribution mismatch penalty. These Virtual data then facilitate per-class lightweight knowledge distillation with the integrated feature representations and the corresponding soft predictions, effectively transferring knowledge from the global model to local models. Notably, unlike other KD-based FL methods, FedVKD does not rely on public datasets or generative models. Moreover, FedVKD can be integrated as a plug-in module into existing FedAvg-based FL methods, enhancing their handling of data heterogeneity. Extensive experiments demonstrate that FedVKD consistently outperforms state-of-the-art methods, achieving up to 7.54% accuracy improvement and $2.58\times $ convergence speedup.
- 20 August 2024
- Published by Springer Nature
- p. 384-397
Forward Secure Searchable Encryption over Medical Cloud Data
- 20 August 2024
- Published by Springer Nature
- p. 384-397
Forward Secure Searchable Encryption over Medical Cloud Data
- 28 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 207-220
An Efficient and Dynamic Privacy-Preserving Federated Learning System for Edge Computing
Federated learning (FL) has been used to enhance privacy protection in edge computing systems. However, attacks on uploaded model gradients may lead to private data leakage, and edge devices frequently joining and leaving will impact the system running. In this paper, we propose a dynamic and flexible federated edge learning (FEL) scheme that can defend against malicious edge servers and edge devices to recover sensitive data and efficiently manage edge devices. A heterogeneity-aware scheduling strategy is designed to take into account the different impacts of heterogeneous edge devices on global model performance. The strategy determines the order of devices participation in each round based on the relative contribution level of the online edge device model, and the edge device with the highest contribution level is selected first. Numerical experiments show that our system improves test accuracy and time, and the security analyses show that our scheme meets the security requirements.
- 28 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 207-220
An Efficient and Dynamic Privacy-Preserving Federated Learning System for Edge Computing
Federated learning (FL) has been used to enhance privacy protection in edge computing systems. However, attacks on uploaded model gradients may lead to private data leakage, and edge devices frequently joining and leaving will impact the system running. In this paper, we propose a dynamic and flexible federated edge learning (FEL) scheme that can defend against malicious edge servers and edge devices to recover sensitive data and efficiently manage edge devices. A heterogeneity-aware scheduling strategy is designed to take into account the different impacts of heterogeneous edge devices on global model performance. The strategy determines the order of devices participation in each round based on the relative contribution level of the online edge device model, and the edge device with the highest contribution level is selected first. Numerical experiments show that our system improves test accuracy and time, and the security analyses show that our scheme meets the security requirements.
- 29 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (17) , 15314-15324
A Privacy-Preserving Hybrid Range Search Scheme Over Encrypted Electronic Medical Data in IoT Systems
Electronic wearable devices play an important role in the Internet of Things (IoT) systems for collecting medical data. Searching over such numerical medical data help to provide better service and treatment. However, user and data security is a major barrier to public adoption. Existing approaches designed to facilitate secure (range) searches over encrypted data generally incur expensive computational overhead, suffer from unexpected information leakage, and/or have high false-positive results. Therefore, in this paper, we design a hybrid searchable encryption scheme that supports efficient, secure, and accurate range searches over encrypted data sensed and collected from medical IoT devices. The designed graph structure helps to filter out most of the false data, and the batching processing on ciphertexts accelerates the removal of irrelevant data. Unlike most prior works, the proposed random index hides the distribution of data, and the probabilistic fixed-length trapdoor hides the range size and repetition of the query. If necessary, all the encrypted data can be refreshed by the cloud server after a range search. The scheme is proven to be secure in a simulation-based model. Then, we evaluate the performance of our proposed scheme on Microsoft Azure cloud servers and Azure IoT Central. The comparisons with several prior works demonstrate that our scheme supports more efficient secure range searches.
- 29 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (17) , 15314-15324
A Privacy-Preserving Hybrid Range Search Scheme Over Encrypted Electronic Medical Data in IoT Systems
Electronic wearable devices play an important role in the Internet of Things (IoT) systems for collecting medical data. Searching over such numerical medical data help to provide better service and treatment. However, user and data security is a major barrier to public adoption. Existing approaches designed to facilitate secure (range) searches over encrypted data generally incur expensive computational overhead, suffer from unexpected information leakage, and/or have high false-positive results. Therefore, in this paper, we design a hybrid searchable encryption scheme that supports efficient, secure, and accurate range searches over encrypted data sensed and collected from medical IoT devices. The designed graph structure helps to filter out most of the false data, and the batching processing on ciphertexts accelerates the removal of irrelevant data. Unlike most prior works, the proposed random index hides the distribution of data, and the probabilistic fixed-length trapdoor hides the range size and repetition of the query. If necessary, all the encrypted data can be refreshed by the cloud server after a range search. The scheme is proven to be secure in a simulation-based model. Then, we evaluate the performance of our proposed scheme on Microsoft Azure cloud servers and Azure IoT Central. The comparisons with several prior works demonstrate that our scheme supports more efficient secure range searches.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (2) , 746-763
Forward Private Verifiable Dynamic Searchable Symmetric Encryption With Efficient Conjunctive Query
Dynamic searchable symmetric encryption (DSSE) allows efficient searches over encrypted databases and also supports clients in their updating of the data, such as those stored in a remote cloud server. However, recent attacks suggest the risk of leakage during such updates, which consequently impacts on the privacy of the queries. In addition, existing DSSE schemes that support forward privacy generally rely on the honest-but-curious server and support only single-keyword retrieval, which limits the application scenarios. In this paper, we present the design of a verifiable DSSE protocol, which supports efficient conjunctive query with forward privacy. In our scheme, the forward index is constructed by a novel form, i.e., $ t$ -puncturable PRFs, and the authentication tag is designed by symmetric cryptography. During conjunctive queries, we narrow the scope by an inverted index, and then we determine the results of the final query through the forward index. Meanwhile, we can use verification tag to check the correctness and completeness of the result. In addition, we give an extension to support the backward privacy and our experimental evaluations show that our proposed approach achieves better performance on both conjunctive queries and updates than other competing solutions, and possesses efficient verification.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (2) , 746-763
Forward Private Verifiable Dynamic Searchable Symmetric Encryption With Efficient Conjunctive Query
Dynamic searchable symmetric encryption (DSSE) allows efficient searches over encrypted databases and also supports clients in their updating of the data, such as those stored in a remote cloud server. However, recent attacks suggest the risk of leakage during such updates, which consequently impacts on the privacy of the queries. In addition, existing DSSE schemes that support forward privacy generally rely on the honest-but-curious server and support only single-keyword retrieval, which limits the application scenarios. In this paper, we present the design of a verifiable DSSE protocol, which supports efficient conjunctive query with forward privacy. In our scheme, the forward index is constructed by a novel form, i.e., $ t$ -puncturable PRFs, and the authentication tag is designed by symmetric cryptography. During conjunctive queries, we narrow the scope by an inverted index, and then we determine the results of the final query through the forward index. Meanwhile, we can use verification tag to check the correctness and completeness of the result. In addition, we give an extension to support the backward privacy and our experimental evaluations show that our proposed approach achieves better performance on both conjunctive queries and updates than other competing solutions, and possesses efficient verification.