On Using Secure Aggregation in Differentially Private Federated Learning with Multiple Local Steps

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Heikkilä, Mikko A.
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909550518468608
author Heikkilä, Mikko A.
author_facet Heikkilä, Mikko A.
contents Federated learning is a distributed learning setting where the main aim is to train machine learning models without having to share raw data but only what is required for learning. To guarantee training data privacy and high-utility models, differential privacy and secure aggregation techniques are often combined with federated learning. However, with fine-grained protection granularities, e.g., with the common sample-level protection, the currently existing techniques generally require the parties to communicate for each local optimization step, if they want to fully benefit from the secure aggregation in terms of the resulting formal privacy guarantees. In this paper, we show how a simple new analysis allows the parties to perform multiple local optimization steps while still benefiting from using secure aggregation. We show that our analysis enables higher utility models with guaranteed privacy protection under limited number of communication rounds.
format Preprint
id arxiv_https___arxiv_org_abs_2407_19286
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On Using Secure Aggregation in Differentially Private Federated Learning with Multiple Local Steps
Heikkilä, Mikko A.
Machine Learning
Cryptography and Security
Federated learning is a distributed learning setting where the main aim is to train machine learning models without having to share raw data but only what is required for learning. To guarantee training data privacy and high-utility models, differential privacy and secure aggregation techniques are often combined with federated learning. However, with fine-grained protection granularities, e.g., with the common sample-level protection, the currently existing techniques generally require the parties to communicate for each local optimization step, if they want to fully benefit from the secure aggregation in terms of the resulting formal privacy guarantees. In this paper, we show how a simple new analysis allows the parties to perform multiple local optimization steps while still benefiting from using secure aggregation. We show that our analysis enables higher utility models with guaranteed privacy protection under limited number of communication rounds.
title On Using Secure Aggregation in Differentially Private Federated Learning with Multiple Local Steps
topic Machine Learning
Cryptography and Security
url https://arxiv.org/abs/2407.19286