arXiv Machine Learning

Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation

arXiv:2609. 01945v1 Announce Type: cross Abstract: Federated Learning enables multiple clients to train a shared model while keeping their local datasets isolated.

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
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 AI
Sep 3

HEAT: Faster Fully Homomorphic Inference via Approximations-Weights Co-Adaptation

HEAT introduces a fine‑tuning method that treats the number of iterations used to approximate nonlinearities in fully homomorphic encryption (FHE) as learnable parameters, allowing them to co‑adapt with model weights. By optimizing iteration counts per nonlinearity, HEAT reduces the required iterations, bootstraps, and overall latency for encrypted GPT‑2 decoding while improving decode agreement. The approach achieves a 3.1× reduction in iterations, a 1.6× reduction in bootstraps, and a 1.4× speed‑up in end‑to‑end latency without changing the model architecture or requiring retraining from scratch.

By Alessandro Zirilli, Davide Marincione, Evgenios M. Kornaropoulos, Giuseppe Ateniese, Emanuele Rodol\`a
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
arXiv AI
Jun 18

Practical Anonymous Two-Party Gradient Boosting Decision Tree

arXiv:2605. 26903v2 Announce Type: replace-cross Abstract: Structured data is well handled by gradient-boosted decision trees (GBDT), which are usually trained on vertically partitioned features across mutually distrustful parties.

By Chenyu Huang, Fan Zhang, Minxin Du, Sherman S. M. Chow, Huangxun Chen, Huaming Rao, Danqing Huang, Bo Qian, Peng Chen