arXiv Machine Learning

Secure Aggregation with Top-K Sparsification in Decentralized Federated Learning

arXiv:2606. 10780v1 Announce Type: cross Abstract: Secure aggregation is a vital component for mitigating gradient leakage in federated learning, but its communication cost conventionally scales with the gradient dimension.

arXiv Machine Learning
Aug 3

Communication-Efficient Secure Aggregation in Decentralized Learning

arXiv:2405. 07708v3 Announce Type: replace Abstract: Decentralized learning (DL) enables participants to collaboratively train models without a central server, yet it faces significant scalability challenges that demand sparsification to reduce the prohibitive communication costs of peer-to-peer exchange.

By Sayan Biswas, Anne-Marie Kermarrec, Rafael Pires, Rishi Sharma, Milos Vujasinovic
arXiv Machine Learning
Sep 10

When Topology Betrays Privacy: Lattice-Based Reconstruction Attacks on Secure Aggregation in Decentralized Federated Learning

The paper demonstrates that in decentralized federated learning, secure aggregation implemented through local neighborhood aggregation can leak private model updates. By exploiting the asymmetric aggregate views available to colluding semi‑honest nodes, the authors formulate the problem as a Hidden Subset Sum Problem and develop a lattice‑based reconstruction attack. Experiments on image, tabular, and text datasets show that attackers can recover honest participants’ updates and reconstruct private training data.

By Wenrui Yu, Changlong Ji, Johannes Bjerva, Qiongxiu Li
Hugging Face Trending Papers
Jul 7

PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning

Federated Learning (FL) enables multiple clients to collaboratively train machine learning models while retaining data locality, thereby enhancing user privacy. However, traditional FL frameworks rely on a centralized aggregation server and assume honest-but-curious clients, making them susceptible to both server-side inference and client-side poisoning attacks.

arXiv Machine Learning
1d ago

Latent Information Sharing for Accelerating Federated Learning

The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.

By Seungjun Lee, Ensieh Khazaei, Dimitrios Hatzinakos, Baturalp Buyukates, Sunwoo Lee
arXiv Machine Learning
Sep 15

End-to-End Verifiable and Robust Federated Learning

arXiv:2609.15521v1 Announce Type: new Abstract: Federated learning enables multiple parties to train a shared model without centralizing raw data with the help of an aggregator, but introduces integr...

By Doryan Lesaignoux, Enrique M\'armol Campos, Gabriele Spini, Jos\'e L. Hern\'andez-Ramos, Stephan Krenn
Hugging Face Trending Papers
Jun 1

IntraShuffler: A Privacy Preserving Framework for Heterogeneous DP Federated Learning

Heterogeneous Differential Privacy (HDP) in Federated Learning (FL) allows clients to select individual privacy budgets ($\varepsilon_i$) according to institutional policies and data sensitivity. In practice, many HDP-FL systems employ $\varepsilon$-aware server aggregation to improve model utility by re-weighting client updates according to their declared privacy budgets.