paper-with-me

홈 › Papers

SABLE: Secure And Byzantine robust LEarning

2023-09-11 · Antoine Choffrut, Rachid Guerraoui, Rafael Pinot, Renaud Sirdey, John Stephan, Martin Zuber

Due to the widespread availability of data, machine learning (ML) algorithms are increasingly being implemented in distributed topologies, wherein various nodes collaborate to train ML models via the coordination of a central server. However, distributed learning approaches face significant vulnerabilities, primarily stemming from two potential threats. Firstly, the presence of Byzantine nodes poses a risk of corrupting the learning process by transmitting inaccurate information to the server. Secondly, a curious server may compromise the privacy of individual nodes, sometimes reconstructing the entirety of the nodes' data. Homomorphic encryption (HE) has emerged as a leading security measure to preserve privacy in distributed learning under non-Byzantine scenarios. However, the extensive computational demands of HE, particularly for high-dimensional ML models, have deterred attempts to design purely homomorphic operators for non-linear robust aggregators. This paper introduces SABLE, the first homomorphic and Byzantine robust distributed learning algorithm. SABLE leverages HTS, a novel and efficient homomorphic operator implementing the prominent coordinate-wise trimmed mean robust aggregator. Designing HTS enables us to implement HMED, a novel homomorphic median aggregator. Extensive experiments on standard ML tasks demonstrate that SABLE achieves practical execution times while maintaining an ML accuracy comparable to its non-private counterpart.

📄 PDF Abstract BibTeX arXiv:2309.05395

Code (0)

등록된 구현이 없습니다.

Tasks

Image ClassificationPrivacy Preserving

Similar Papers 제목 키워드 기반

A Secure Aggregation for Federated Learning on Long-Tailed Data

2023-07-17 · Yanna Jiang, Baihe Ma, Xu Wang, Guangsheng Yu 외

As a distributed learning, Federated Learning (FL) faces two challenges: the unbalanced distribution of training data among participants, and the model attack by Byzantine nodes. In this paper, we consider the long-taile…

Federated Learning

Secure Byzantine-Robust Distributed Learning via Clustering

2021-10-06 · Raj Kiriti Velicheti, Derek Xia, Oluwasanmi Koyejo

Federated learning systems that jointly preserve Byzantine robustness and privacy have remained an open problem. Robust aggregation, the standard defense for Byzantine attacks, generally requires server access to individ…

ClusteringFederated LearningPrivacy Preserving

Privacy-Preserving Aggregation for Decentralized Learning with Byzantine-Robustness

2024-04-27 · Ali Reza Ghavamipour, Benjamin Zi Hao Zhao, Oguzhan Ersoy, Fatih Turkmen

Decentralized machine learning (DL) has been receiving an increasing interest recently due to the elimination of a single point of failure, present in Federated learning setting. Yet, it is threatened by the looming thre…

Federated LearningPrivacy Preserving

Byzantine-Resilient Secure Federated Learning

2020-07-21 · Jinhyun So, Basak Guler, A. Salman Avestimehr

Secure federated learning is a privacy-preserving framework to improve machine learning models by training over large volumes of data collected by mobile users. This is achieved through an iterative process where, at eac…

Federated LearningOutlier DetectionPrivacy PreservingQuantization

LoByITFL: Low Communication Secure and Private Federated Learning

2024-05-29 · Yue Xia, Maximilian Egger, Christoph Hofmeister, Rawad Bitar

Privacy of the clients' data and security against Byzantine clients are key challenges in Federated Learning (FL). Existing solutions to joint privacy and security incur sacrifices on the privacy guarantee. We introduce …

Federated Learning