- Research Article
- 10.1109/jiot.2025.3627962
Value-Compensated Decentralized Data Sharing: Can a Dual-Blockchain Framework With a Proof-of-Lightweight-Shapley Algorithm Make It Possible?
- Jan 01, 2026
- IEEE Internet of Things Journal
- Ziwen Cheng + 6 more +6
The recent convergence of blockchain with federated learning (BCFL) offers enhanced data privacy, traceability, and ownership protection for decentralized data sharing. However, current research lacks consensus on accurate and fair data valuation methods for decentralized environments-a critical yet unresolved challenge. Existing Shapley value (SV)-based data valuation methods, while promising, rely on centralized frameworks ill-suited for decentralized environments and incur high computational costs. To address this, we propose a scalable dual-chain architecture: the main chain handles primary BCFL data-sharing operations, while a dedicated side chain offloads data valuation tasks. For the side chain, we introduce the Proof-of-Lightweight-Shapley (PoLS) protocol, enabling decentralized SV computation with theoretical convergence guarantees. PoLS leverages a proof-of-work-inspised mechanism to facilitate parallel and lightweight computation of shapley values using Monte Carlo sampling. Furthermore, we develop a SV-based data aggregation protocol to validate PoLS effectiveness and enhance resilience against low-quality data attacks. Extensive experiments confirm that PoLS significantly reduces computational overhead while maintaining an average deviation as low as 2.3% from the true shapley value. Moreover, in adversarial scenarios, the PoLS-driven aggregation strategy improves model accuracy by 25.7% over baselines, thereby strengthening the robustness and fairness of the decentralized valuable data sharing.
Read more