Sep 2026· IEEE Internet of Things Journal· Vol 13, pp. 40185-40197· 0 citations· 36 references
Computer Science
Abstract
Split federated learning (SFL) is renowned for its low computational overhead, extremely suitable for resource-constrained edge computing scenarios while inheriting privacy-preserving characteristics from federated learning (FL). In this framework, clients employ lightweight models to process private data locally and transmit intermediate outputs to a powerful server for further computation. However, SFL is a double-edged sword: while it enables edge computing and enhances privacy, it also introduces intellectual property ambiguity as both clients and the server jointly contribute to training. Existing watermarking techniques fail to protect both sides since no single participant possesses the complete model. To address this, we propose a robust model intellectual property protection scheme using client–server watermark embedding (RISE) for SFL. Specifically, RISE adopts an asymmetric client–server watermarking design: the server embeds feature-based watermarks through a loss regularization term, while clients embed backdoor-based watermarks by injecting predefined trigger samples into private datasets. This co-embedding strategy enables both clients and the server to verify model ownership. Experimental results on standard datasets and multiple network architectures show that RISE achieves over 95% watermark detection rate ( $p$ -value $\lt {\,}0.03$ ) across most settings. It exhibits no mutual interference between client- and server-side watermarks and remains robust against common removal attacks. Our source code is available at GitHub
PVeriFL is a federated learning framework that integrates privacy preservation, Byzantine fault tolerance, and lightweight client-side verifiability and effectively unifies the three security objectives, offering a practical and trustworthy solution for real-world federated learning systems.
Federated learning (FL) is vulnerable to multi-level attacks. However, existing methods address them separately, leaving FL exposed to data leakage, unauthorized reuse, and malicious gradient manipulation. In this work, we propose an FL framework that couples keyed context-provenance watermarking with verifiable lattic...
Federated learning (FL) enables collaborative model training across multiple clients in a privacy-preserving manner. However, the employment of homomorphic encryption algorithms might lead to high computational cost while the application of differential privacy (DP) methods would sacrifice model performance. To establi...
Zhiqiang Chen, Yuchen Jiang, Ray Y. Zhong et al.· IEEE Transactions on Informa...· 0 citations
RetFL is proposed, a CKKS-enabled robust aggregation framework for DFL that establishes a decentralized training workflow with VRF-based candidate selection and view change, and designs a weighted aggregation scheme that incorporates cosine similarity and a dynamic reputation mechanism to weight updates and suppress pe...
Yi-Cheng Huang, Zhou Zhou, You-Liang Tian et al.· Journal of King Saud Univers...· 0 citations
PNFR is designed, a privacy-preserving federated learning scheme for regressions training built on the MPaillier algorithm, which is three times faster than interactive federated regressions PrivFL and about 80% faster than non-interactive federated regressions VANE.
SiftFL is proposed, a scheduling-based robust backdoor detection method that sifts out malicious client models at a fraction of the original cost and preserves and improves the robustness of CGAN-based detection while sharply lowering its server-side cost.
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.