May 26, 2023, 1:19 a.m. | Tayyebeh Jahani-Nezhad, Mohammad Ali Maddah-Ali, Giuseppe Caire

cs.CR updates on arXiv.org arxiv.org

In this paper, we propose an efficient secure aggregation scheme for
federated learning that is protected against Byzantine attacks and privacy
leakages. Processing individual updates to manage adversarial behavior, while
preserving privacy of data against colluding nodes, requires some sort of
secure secret sharing. However, communication load for secret sharing of long
vectors of updates can be very high. To resolve this issue, in the proposed
scheme, local updates are partitioned into smaller sub-vectors and shared using
ramp secret sharing. …

adversarial aggregation attacks computing data federated learning manage nodes privacy sort updates

More from arxiv.org / cs.CR updates on arXiv.org

Toronto Transit Commission (TTC) - Chief Information Security Officer (CISO)

@ BIPOC Executive Search Inc. | Toronto, Ontario, Canada

Unit Manager for Cyber Security Culture & Competence

@ H&M Group | Stockholm, Sweden

Junior Security Engineer

@ Pipedrive | Tallinn, Estonia

Splunk Engineer (TS/SCI)

@ GuidePoint Security LLC | Huntsville, AL

DevSecOps Engineer, SRE (Top Secret) - 1537

@ Reinventing Geospatial (RGi) | Herndon, VA

Governance, Risk and Compliance (GRC) Lead

@ Leidos | Brisbane, Australia