SI-ChainFL: 基于Shapley激励的高铁路数据共享安全联邦学习
SI-ChainFL: Shapley-Incentivized Secure Federated Learning for High-Speed Rail Data Sharing
AI总结:
SI-ChainFL通过结合Shapley激励与去中心化聚合,解决高速铁路数据共享中的激励不足和集中化聚合问题,提升模型准确性和安全性。
摘要:
在高速铁路(HSR)系统中,联邦学习(FL)能够实现跨部门流量预测而无需共享原始数据。然而,现有方案存在两个关键限制:(1)激励不足,导致搭便车和模型中毒;(2)集中化聚合,引入了单点故障。我们提出了一种安全高效的框架SI-ChainFL,通过结合贡献感知激励与去中心化聚合来解决这些问题。首先,我们使用Shapley值指标量化客户端贡献,该指标联合考虑了小概率事件效用、数据多样性、数据质量和时效性。为减少计算开销,我们进一步开发了一种罕见正向驱动的客户端聚类策略以加速Shapley估计。此外,我们设计了一种基于区块链的共识协议用于去中心化聚合,其中聚合资格与Shapley激励相关联。这种设计促使客户端提交高质量的更新,并实现了高效安全的全局聚合。在MNIST、CIFAR 10和CIFAR 100以及HSR流量数据集上的实验表明,SI ChainFL在90%恶意客户端的PA攻击下仍能保持有效,其准确率比RAGA高14.12%。理论分析进一步保证了性能的上界。
英文摘要:
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
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。