Anxiao Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anxiao Song has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Ke Cheng
Xidian University
8 shared publications - Yulong Shen
Xidian University
8 shared publications - Tao Zhang
Xidian University
7 shared publications - Jiaxuan Fu
Xidian University, Xi'an, China
4 shared publications Haoshuo Li
School of Computer Science and Technology, Xidian University, Xian, China
2 shared publications- Shujie Cui
Monash University, Melbourne, Australia
2 shared publications
Latest Publications
- 21 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-15
FSS-DT: Secure Division-free Decision Tree Training and Inference via Function Secret Sharing
Decision tree (DT), an efficient and interpretable machine learning algorithm, has been widely used in numerous industrial applications. As the demand for higher performance grows, there is increasing interest in cross-domain collaboration for training DTs using vertical datasets, where different owners hold distinct features but share the same set of samples. Due to privacy concerns, leveraging secure multi-party computation (MPC) to train DTs jointly has gained significant attention. Although promising, deploying these approaches across large scale vertical datasets presents formidable challenges for two bottlenecks: divisions and comparisons. MPC is not friendly to process divisions, whereas DT training algorithms involve division to evaluate each feature split for each tree node. DT training and inference also involve numerous comparisons, yet existing secure comparisons are still not efficient enough. We propose FSS-DT, a highly efficient two-party framework for secure DT training and inference on vertically distributed datasets. The efficiency of FSS-DT is achieved by designing a division-free MPC-friendly DT algorithm. Moreover, we present a lightweight secure comparison protocol using our optimized distributed comparison function (DCF), an instance of function secret sharing, via “0/1-encoding” and “early termination” techniques. We have implemented a prototype of FSS-DT. Extensive experiments demonstrate that FSS-DT achieves the same accu racy as models trained in plaintext and outperforms the state-of the-art Pivot and PriVDT. Specifically, for training on LAN and WAN over the large UCI dataset, FSS-DT is 17.5× and 51.1× faster than Pivot, and about 8.4× and 8.8× faster than Swan, respectively.
- 21 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-15
FSS-DT: Secure Division-free Decision Tree Training and Inference via Function Secret Sharing
Decision tree (DT), an efficient and interpretable machine learning algorithm, has been widely used in numerous industrial applications. As the demand for higher performance grows, there is increasing interest in cross-domain collaboration for training DTs using vertical datasets, where different owners hold distinct features but share the same set of samples. Due to privacy concerns, leveraging secure multi-party computation (MPC) to train DTs jointly has gained significant attention. Although promising, deploying these approaches across large scale vertical datasets presents formidable challenges for two bottlenecks: divisions and comparisons. MPC is not friendly to process divisions, whereas DT training algorithms involve division to evaluate each feature split for each tree node. DT training and inference also involve numerous comparisons, yet existing secure comparisons are still not efficient enough. We propose FSS-DT, a highly efficient two-party framework for secure DT training and inference on vertically distributed datasets. The efficiency of FSS-DT is achieved by designing a division-free MPC-friendly DT algorithm. Moreover, we present a lightweight secure comparison protocol using our optimized distributed comparison function (DCF), an instance of function secret sharing, via “0/1-encoding” and “early termination” techniques. We have implemented a prototype of FSS-DT. Extensive experiments demonstrate that FSS-DT achieves the same accu racy as models trained in plaintext and outperforms the state-of the-art Pivot and PriVDT. Specifically, for training on LAN and WAN over the large UCI dataset, FSS-DT is 17.5× and 51.1× faster than Pivot, and about 8.4× and 8.8× faster than Swan, respectively.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4124-4138
Mosformer: Maliciously Secure Three-Party Inference Framework for Large Transformers
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4124-4138
Open AccessMosformer: Maliciously Secure Three-Party Inference Framework for Large Transformers
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 37441-37455
GeoFed: Geometry-Aware Byzantine Robust Federated Learning on SPD Manifolds in Heterogeneous Environments
Federated learning (FL) has been increasingly applied in the Internet of Things (IoT), leveraging its decentralized nature to facilitate collaboration among clients and enable resource-constrained clients to jointly train a globally optimal model based on consensus. However, it is difficult to confirm data authenticity and participant integrity due to the unobservability of local training procedures and the inaccessibility of local training data. As a result, FL is highly susceptible to Byzantine attacks, including data poisoning and model poisoning, which can manipulate the training process and degrade model performance. Moreover, IoT data is often highly heterogeneous and high-dimensional, rendering most existing Byzantine-robust FL approaches ineffective in practical scenarios. To address this challenge, we propose GeoFed, which iteratively filters out malicious clients based on the geodesic distance between clients. This geodesic distance is measured on the Riemannian manifold spanned by the covariance of local gradient update. To further mitigate the impact of data heterogeneity, GeoFed assigns a weight factor to each client after removing Byzantine attackers, optimizing the accuracy and flexibility of global model aggregation according to the quality of client data. We conduct extensive experimental evaluations of GeoFed under various Byzantine attack scenarios and highly heterogeneous data environments. To validate the efficacy of GeoFed, we provide a theoretical analysis of its convergence properties. The results demonstrate that GeoFed outperforms state-of-the-art Byzantine-robust FL approaches in heterogeneous IoT settings. Especially, under different Byzantine attacks, the accuracy of detecting malicious clients on the heterogeneous MNIST dataset approaches 100%.
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 37441-37455
GeoFed: Geometry-Aware Byzantine Robust Federated Learning on SPD Manifolds in Heterogeneous Environments
Federated learning (FL) has been increasingly applied in the Internet of Things (IoT), leveraging its decentralized nature to facilitate collaboration among clients and enable resource-constrained clients to jointly train a globally optimal model based on consensus. However, it is difficult to confirm data authenticity and participant integrity due to the unobservability of local training procedures and the inaccessibility of local training data. As a result, FL is highly susceptible to Byzantine attacks, including data poisoning and model poisoning, which can manipulate the training process and degrade model performance. Moreover, IoT data is often highly heterogeneous and high-dimensional, rendering most existing Byzantine-robust FL approaches ineffective in practical scenarios. To address this challenge, we propose GeoFed, which iteratively filters out malicious clients based on the geodesic distance between clients. This geodesic distance is measured on the Riemannian manifold spanned by the covariance of local gradient update. To further mitigate the impact of data heterogeneity, GeoFed assigns a weight factor to each client after removing Byzantine attackers, optimizing the accuracy and flexibility of global model aggregation according to the quality of client data. We conduct extensive experimental evaluations of GeoFed under various Byzantine attack scenarios and highly heterogeneous data environments. To validate the efficacy of GeoFed, we provide a theoretical analysis of its convergence properties. The results demonstrate that GeoFed outperforms state-of-the-art Byzantine-robust FL approaches in heterogeneous IoT settings. Especially, under different Byzantine attacks, the accuracy of detecting malicious clients on the heterogeneous MNIST dataset approaches 100%.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6088-6103
Private Learning for Vertical Decision Trees: A Secure, Accurate, and Fast Realization
Private learning for vertical decision trees (PVDT) is an emerging paradigm that allows multiple parties to execute cooperative training and inference of decision trees on vertically partitioned datasets, without revealing either party%'s data or model. The state-of-the-art PVDT schemes employ the secret-sharing-based secure multi-party computation (MPC) to admit low computational cost and low bandwidth. Nevertheless, existing schemes need many communication rounds for computing concrete protocols in PVDT, like the less-than comparison, division, etc. This property is not suited for large-communication-latency networks such as WAN. In this work, we present a two-party PVDT framework, called Swan, to enable a secure, accurate, and fast realization of vertical decision trees. At the core of Swan, we design a secure and parallel protocol for $N$-input multiplication with one communication round. This forms the cornerstone for a series of secure and communication-efficient computation protocols specifically tailored to less-than comparison and division. Along the way, we use these optimized protocols to refine the training and inference processes of PVDT, achieving a significant reduction in both communication costs and rounds. Experimental results show Swan provides top-notch accuracy, and achieves a $10.2\times$ and $2.8\times$ improvement in online training and inference latency over WAN compared to prior art.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6088-6103
Private Learning for Vertical Decision Trees: A Secure, Accurate, and Fast Realization
Private learning for vertical decision trees (PVDT) is an emerging paradigm that allows multiple parties to execute cooperative training and inference of decision trees on vertically partitioned datasets, without revealing either party%'s data or model. The state-of-the-art PVDT schemes employ the secret-sharing-based secure multi-party computation (MPC) to admit low computational cost and low bandwidth. Nevertheless, existing schemes need many communication rounds for computing concrete protocols in PVDT, like the less-than comparison, division, etc. This property is not suited for large-communication-latency networks such as WAN. In this work, we present a two-party PVDT framework, called Swan, to enable a secure, accurate, and fast realization of vertical decision trees. At the core of Swan, we design a secure and parallel protocol for $N$-input multiplication with one communication round. This forms the cornerstone for a series of secure and communication-efficient computation protocols specifically tailored to less-than comparison and division. Along the way, we use these optimized protocols to refine the training and inference processes of PVDT, achieving a significant reduction in both communication costs and rounds. Experimental results show Swan provides top-notch accuracy, and achieves a $10.2\times$ and $2.8\times$ improvement in online training and inference latency over WAN compared to prior art.
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 29073-29088
Byzantine-Robust Federated Learning Framework via a Server-Client Defense Mechanisms
Federated learning (FL), a distributed machine learning (ML) framework, is susceptible to Byzantine attacks since the attacker can manipulate clients’ local data or models to compromise the performance of the global model. There has been a wealth of defenses developed to mitigate the attacks by limiting the impact of malicious models. Nevertheless, the attacker can easily circumvent these approaches that rely solely on a single server-side defense, stemming from the high dimensionality of models and the variety of Byzantine attacks. Therefore, we propose Basalt, a Byzantine-robust FL framework with a server-client joint defense mechanism that enables multiple clients to train a global ML model under Byzantine attacks. On the client side, we design an efficient self-defense approach with model-level penalty loss that restricts local-benign divergence and decreases local-malicious correlation to prevent misclassification. On the server side, we present an efficient defense strategy based on the manifold and maximum clique, further strengthening the FL’s resilience against Byzantine attacks. We provide theoretical guarantees for global model convergence in FL with Byzantine attacks. Our extensive experiments demonstrate that Basalt outperforms existing state-of-the-art works. Especially, it achieves nearly 100% accuracy for detecting malicious clients in nonindependent and identically distributed (Non-IID) MNIST datasets under various Byzantine attacks.
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 29073-29088
Byzantine-Robust Federated Learning Framework via a Server-Client Defense Mechanisms
Federated learning (FL), a distributed machine learning (ML) framework, is susceptible to Byzantine attacks since the attacker can manipulate clients’ local data or models to compromise the performance of the global model. There has been a wealth of defenses developed to mitigate the attacks by limiting the impact of malicious models. Nevertheless, the attacker can easily circumvent these approaches that rely solely on a single server-side defense, stemming from the high dimensionality of models and the variety of Byzantine attacks. Therefore, we propose Basalt, a Byzantine-robust FL framework with a server-client joint defense mechanism that enables multiple clients to train a global ML model under Byzantine attacks. On the client side, we design an efficient self-defense approach with model-level penalty loss that restricts local-benign divergence and decreases local-malicious correlation to prevent misclassification. On the server side, we present an efficient defense strategy based on the manifold and maximum clique, further strengthening the FL’s resilience against Byzantine attacks. We provide theoretical guarantees for global model convergence in FL with Byzantine attacks. Our extensive experiments demonstrate that Basalt outperforms existing state-of-the-art works. Especially, it achieves nearly 100% accuracy for detecting malicious clients in nonindependent and identically distributed (Non-IID) MNIST datasets under various Byzantine attacks.
- Open Access
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2025 (1)
Dynamic Pattern Matching on Encrypted Data With Forward and Backward Security
Pattern matching is widely used in applications such as genomic data query analysis, network intrusion detection, and deep packet inspection (DPI). Performing pattern matching on plaintext data is straightforward, but the need to protect the security of analyzed data and analyzed patterns can significantly complicate the process. Due to the privacy security issues of data and patterns, researchers begin to explore pattern matching on encrypted data. However, existing solutions are typically built on static pattern matching methods, lacking dynamism, namely, the inability to perform addition or deletion operations on the analyzed data. This lack of flexibility might hinder the adaptability and effectiveness of pattern matching on encrypted data in the real‐world scenarios. In this paper, we design a dynamic pattern matching scheme on encrypted data with forward and backward security, which introduces much‐needed dynamism. Our scheme is able to implement the addition operation and the deletion operation on the encrypted data without affecting the security of the original pattern matching scheme. Specifically, we design secure addition and deletion algorithms based on fragmentation data structures, which are compatible with the static pattern matching scheme. Moreover, we make significant improvements to the key generation algorithm, the encryption algorithm, and the match algorithm of the static scheme to ensure forward and backward security. Theoretical analysis proves that our scheme satisfies forward and backward security while ensuring the nonfalsifiability of encrypted data. The experimental results show that our scheme has a slight increase in time cost compared to the static pattern matching scheme, demonstrating its practicality and effectiveness in dynamic scenarios.
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2025 (1)
Open AccessDynamic Pattern Matching on Encrypted Data With Forward and Backward Security
Pattern matching is widely used in applications such as genomic data query analysis, network intrusion detection, and deep packet inspection (DPI). Performing pattern matching on plaintext data is straightforward, but the need to protect the security of analyzed data and analyzed patterns can significantly complicate the process. Due to the privacy security issues of data and patterns, researchers begin to explore pattern matching on encrypted data. However, existing solutions are typically built on static pattern matching methods, lacking dynamism, namely, the inability to perform addition or deletion operations on the analyzed data. This lack of flexibility might hinder the adaptability and effectiveness of pattern matching on encrypted data in the real‐world scenarios. In this paper, we design a dynamic pattern matching scheme on encrypted data with forward and backward security, which introduces much‐needed dynamism. Our scheme is able to implement the addition operation and the deletion operation on the encrypted data without affecting the security of the original pattern matching scheme. Specifically, we design secure addition and deletion algorithms based on fragmentation data structures, which are compatible with the static pattern matching scheme. Moreover, we make significant improvements to the key generation algorithm, the encryption algorithm, and the match algorithm of the static scheme to ensure forward and backward security. Theoretical analysis proves that our scheme satisfies forward and backward security while ensuring the nonfalsifiability of encrypted data. The experimental results show that our scheme has a slight increase in time cost compared to the static pattern matching scheme, demonstrating its practicality and effectiveness in dynamic scenarios.
- 4 November 2024
- Published by Springer Nature
- p. 395-409
FBR-FL: Fair and Byzantine-Robust Federated Learning via SPD Manifold
- 4 November 2024
- Published by Springer Nature
- p. 395-409
FBR-FL: Fair and Byzantine-Robust Federated Learning via SPD Manifold
- 6 September 2024
- Published by Springer Nature
- p. 310-330
Private Decision Tree Evaluation with Malicious Security via Function Secret Sharing
- 6 September 2024
- Published by Springer Nature
- p. 310-330
Private Decision Tree Evaluation with Malicious Security via Function Secret Sharing
- 19 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 7759-7773
FSS-DBSCAN: Outsourced Private Density-Based Clustering via Function Secret Sharing
Density-based clustering algorithms such as DBSCAN, are highly effective in handling large datasets and identifying clusters of arbitrary shapes, playing a crucial role in data analysis fields like outlier detection and social networks. Outsourcing DBSCAN to the cloud brings substantial benefits but also raises major privacy concerns regarding the private input data of data owners. Existing private DBSCAN methods often face challenges of inefficiency or potential privacy leakage, hindering their practical deployment. To address these challenges, we introduce FSS-DBSCAN, a three-server MPC platform designed for outsourced private density-based clustering using function secret sharing (FSS). This solution guarantees clustering quality equivalent to plaintext algorithms, ensures comprehensive privacy protection, and achieves top-tier efficiency. The high performance of FSS-DBSCAN is driven by two pivotal strategies. First, we devise an MPC-friendly DBSCAN algorithm that is highly compatible with efficient secret-sharing-based cryptographic protocols and benefits from GPU acceleration. Second, we construct novel FSS-based protocols tailored for complex operations integral to our DBSCAN variant, such as Euclidean distance comparison and point assignment, and further optimize their computation through tensorization techniques. We implement our platform as an extensible system on top of PyTorch that leverages GPU hardware acceleration for cryptographic and tensorized operations. These innovations enable FSS-DBSCAN to significantly outperform ppDBSCAN (AsiaCCS 2021), reducing the clustering time for 5000 samples to approximately 2 hours, achieving an 83.4× speed improvement.
- 19 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 7759-7773
FSS-DBSCAN: Outsourced Private Density-Based Clustering via Function Secret Sharing
Density-based clustering algorithms such as DBSCAN, are highly effective in handling large datasets and identifying clusters of arbitrary shapes, playing a crucial role in data analysis fields like outlier detection and social networks. Outsourcing DBSCAN to the cloud brings substantial benefits but also raises major privacy concerns regarding the private input data of data owners. Existing private DBSCAN methods often face challenges of inefficiency or potential privacy leakage, hindering their practical deployment. To address these challenges, we introduce FSS-DBSCAN, a three-server MPC platform designed for outsourced private density-based clustering using function secret sharing (FSS). This solution guarantees clustering quality equivalent to plaintext algorithms, ensures comprehensive privacy protection, and achieves top-tier efficiency. The high performance of FSS-DBSCAN is driven by two pivotal strategies. First, we devise an MPC-friendly DBSCAN algorithm that is highly compatible with efficient secret-sharing-based cryptographic protocols and benefits from GPU acceleration. Second, we construct novel FSS-based protocols tailored for complex operations integral to our DBSCAN variant, such as Euclidean distance comparison and point assignment, and further optimize their computation through tensorization techniques. We implement our platform as an extensible system on top of PyTorch that leverages GPU hardware acceleration for cryptographic and tensorized operations. These innovations enable FSS-DBSCAN to significantly outperform ppDBSCAN (AsiaCCS 2021), reducing the clustering time for 5000 samples to approximately 2 hours, achieving an 83.4× speed improvement.
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (16) , 27557-27570
Guard-FL: An UMAP-Assisted Robust Aggregation for Federated Learning
Federated learning (FL) in Internet of Things (IoT) applications facilitates the collaborative training of a global model across distributed devices with a server. Despite its potential, the distributed nature and vulnerability of IoT devices render FL susceptible to Byzantine attacks. Existing approaches to counter these attacks are often impractical in real-world IoT scenarios, mainly due to the challenges posed by nonindependent identically distributed (non-IID) data and the high-dimensional model common in IoT devices. To address these challenges, we propose Guard-FL, an efficient and robust aggregation mechanism assisted by uniform manifold approximation and projection (UMAP) for FL. Guard-FL is designed to enhance the performance of the global model in non-IID data environments without compromising defense capabilities. Specifically, it utilizes UMAP to capture non-linear features among high-dimensional local models. Based on these features, robust regression and unsupervised clustering techniques are applied to effectively detect and remove attackers from local model updates. Subsequently, the server employs information stored in weights to evaluate and aggregate the remaining divergent model updates, thus significantly improving the global models performance. To validate the efficacy of Guard-FL, we provide a theoretical analysis of its convergence properties. Our experiments demonstrate that Guard-FL surpasses existing stateof-the-art solutions, achieving up to 96% accuracy in detecting malicious clients on non-IID CIFAR-10 datasets under various Byzantine attack scenarios. The implementation code is provided at https://github.com/XidianNSS/Guard-FL.git
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (16) , 27557-27570
Guard-FL: An UMAP-Assisted Robust Aggregation for Federated Learning
Federated learning (FL) in Internet of Things (IoT) applications facilitates the collaborative training of a global model across distributed devices with a server. Despite its potential, the distributed nature and vulnerability of IoT devices render FL susceptible to Byzantine attacks. Existing approaches to counter these attacks are often impractical in real-world IoT scenarios, mainly due to the challenges posed by nonindependent identically distributed (non-IID) data and the high-dimensional model common in IoT devices. To address these challenges, we propose Guard-FL, an efficient and robust aggregation mechanism assisted by uniform manifold approximation and projection (UMAP) for FL. Guard-FL is designed to enhance the performance of the global model in non-IID data environments without compromising defense capabilities. Specifically, it utilizes UMAP to capture non-linear features among high-dimensional local models. Based on these features, robust regression and unsupervised clustering techniques are applied to effectively detect and remove attackers from local model updates. Subsequently, the server employs information stored in weights to evaluate and aggregate the remaining divergent model updates, thus significantly improving the global models performance. To validate the efficacy of Guard-FL, we provide a theoretical analysis of its convergence properties. Our experiments demonstrate that Guard-FL surpasses existing stateof-the-art solutions, achieving up to 96% accuracy in detecting malicious clients on non-IID CIFAR-10 datasets under various Byzantine attack scenarios. The implementation code is provided at https://github.com/XidianNSS/Guard-FL.git