English

SI-ChainFL: Shapley-Incentivized Secure Federated Learning for High-Speed Rail Data Sharing

Distributed, Parallel, and Cluster Computing 2026-03-10 v1

Abstract

In high-speed rail (HSR) systems, federated learning (FL) enables cross-departmental flow prediction without sharing raw data. However, existing schemes suffer from two key limitations: (1) insufficient incentives, leading to free-riding and model poisoning; and (2) centralized aggregation, which introduces a single point of failure. We propose a secure and efficient framework SI-ChainFL that addresses these issues by combining contribution-aware incentives with decentralized aggregation. First, we quantify client contributions using a Shapley value metric that jointly considers rare-event utility, data diversity, data quality, and timeliness. To reduce computational overhead, we further develop a rare positive driven client clustering strategy to accelerate Shapley estimation. Moreover, we design a blockchain-based consensus protocol for decentralized aggregation, where aggregation eligibility is tied to Shapley incentives. This design motivates clients to submit high-quality updates and enables efficient and secure global aggregation. Experiments on MNIST, CIFAR 10 and CIFAR 100, and a HSR flow dataset show that SI ChainFL remains effective under 90% malicious clients in PA attacks, achieving 14.12% higher accuracy than RAGA. Theoretical analysis further guarantees an upper bound on performance

Keywords

Cite

@article{arxiv.2603.07992,
  title  = {SI-ChainFL: Shapley-Incentivized Secure Federated Learning for High-Speed Rail Data Sharing},
  author = {Mingjie Zhao and Cheng Dai and Fei Chen and Xin Chen and Kaoru Ota and Mianxiong Dong and Bing Guo},
  journal= {arXiv preprint arXiv:2603.07992},
  year   = {2026}
}

Comments

17 pages, 19 figures

R2 v1 2026-07-01T11:09:42.328Z