Traditional federated learning addresses the data security issues arising from the need to centralize client datasets on a central server for model training. However, this approach still poses privacy protection risks. For instance, central servers cannot verify privacy leaks resulting from poisoning attacks by malicious clients. Additionally, adversarial sample attacks can infer specific samples from the original data by testing the local models on client devices. This paper proposes a federated learning privacy protection method combining distillation defense technology with blockchain architecture. The method utilizes distillation defense technology to reduce the sensitivity of client devices participating in federated learning to perturbations and enhance their ability to resist adversarial sample attacks locally. This not only reduces communication overhead and improves learning efficiency but also enhances the model’s generalization ability. Furthermore, the method leverages the “decentralized” nature of blockchain architecture as a trusted record-keeping mechanism to audit information interactions among clients and shared model parameters. This addresses privacy leakage issues resulting from poisoning attacks by some clients during the model construction process. Simulation experiment results demonstrate that the proposed method, compared with traditional federated learning, ensures model convergence, detects malicious clients, and improves the participation level of highly reputable clients. Moreover, by reducing the sensitivity of local clients to perturbations, it enhances their ability to effectively resist adversarial sample attacks.
17 March 2026 in Journal of Network and Systems Management
Self-similar data streams are characterized by their similarity across multiple time scales, exhibiting distinct nonlinear and discrete features. These characteristics complicate the accurate identification of data points associated with soft error features, thereby making it difficult to effectively discern the intricate relationship between the data flow and soft error data. This, in turn, severely impacts the accuracy of soft error detection in self-similar data streams. In this study, we propose a novel approach to address this challenge. Leveraging the suddenness and long-range correlation inherent in self-similar data streams, we construct a time series model to capture the data stream based on linear correlation and straight-line fitting features. By incorporating relationship parameters to fit neighboring flow points, we utilize a structural mapping model to establish the local angular relationship between the data streams and soft error data. Additionally, we construct a structural mapping network using flow features to achieve soft error detection in self-similar data streams. Experimental results demonstrate that our proposed method achieves high accuracy and low time overhead for soft error detection in self-similar data streams.