Federated Learning with Gaussian Differential Privacy
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
In recent years, federated learning has rapidly become a new research hotspot in the field of secure machine learning. However, unprotected traditional federated learning can easily leak information, which unable to meet users' anonymization needs. Differential privacy is widely used in privacy protection due to its excellent privacy quantification properties, but differential privacy as a lossy protection will reduce the accuracy of the machine learning model. This paper proposes a federated learning algorithm based on Gaussian differential privacy, Noisy-FL, which can more accurately track the changes in privacy loss during model training. Noisy-FL can achieve user-level privacy protection while increasing the number of communication rounds compared to the previous algorithm. Experimental results show that the new algorithm can increase the number of communication rounds by 3 times, and when the total number of clients is small, the model accuracy of the Noisy-FL algorithm is increased by 10% compared to the previous algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956 · cited 1×
“Although secure multi-party computing and homomorphic encryption can provide good user-level privacy protection, the excessive computational overhead makes it impossible to perform large-scale, low-power federated learning tasks [16][18].”
BackgroundBoosting and Differential Privacy
Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784 · cited 1×
“[12] designed an improved composition theorem, but did not capture the correct hypothesis test trade-off.”
BackgroundSecureBoost: A Lossless Federated Learning Framework
Cheng, K., Fan, T., Jin, Y., Liu, Y., Chen, T., Papadopoulos, D., & Yang, Q. (2021) · IEEE Intelligent Systems · doi:10.1109/mis.2021.3082561 · Cited by 669
SecureBoost: A Lossless Federated Learning Framework
Cheng, K., Fan, T., Jin, Y., Liu, Y., Chen, T., Papadopoulos, D., & Yang, Q. (2019) · arXiv · doi:10.48550/arxiv.1901.08755 · Cited by 668
Dong, J., Roth, A., & Su, W. J. (2019) · arXiv · doi:10.48550/arxiv.1905.02383 · Cited by 389
BACombo—Bandwidth-Aware Decentralized Federated Learning
Jiang, J., Hu, L., Hu, C., Liu, J., & Wang, Z. (2020) · Electronics · doi:10.3390/electronics9030440 · Cited by 47 · cited 1×
“However, many recent studies have shown that model gradient information still has a great risk of privacy leakage [11][14][15].”
Background
Cited by
Vulnerabilities in federated learning
Bouacida, N., & Mohapatra, P. (2021) · IEEE Access · doi:10.1109/access.2021.3075203 · Cited by 248
“Common defenses against model poisoning enforce norm thresholding on client model updates (e.g., by ignoring the client updates whose norms exceed some threshold) [61] or add Gaussian noise to the aggregate [62].”
BackgroundPoisoning attacks in federated learning: A survey
Xia, G., Chen, J., Yu, C., & Ma, J. (2023) · IEEE Access · doi:10.1109/access.2023.3238823 · Cited by 212
A survey on differential privacy for medical data analysis
Liu, W., Zhang, Y., Yang, H., & Meng, Q. (2024) · Annals of Data Science · doi:10.1007/s40745-023-00475-3 · Cited by 66
“25 δ f /ε, Gaussian noise mechanism can be expressed as: M(D) = f (D) + N0, f 2 · σ 2) [22, 23], N is the standard Gaussian”
Privacy preserving and secure robust federated learning: A survey
Han, Q., Lu, S., Wang, W., Qu, H., Li, J., & Gao, Y. (2024) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.8084 · Cited by 29
Metadata
- Authors
- Chuanxin, Z., Yi, S., & Degang, W.
- Venue
- Proceedings of the 2020 2nd International Conference on Robotics, Intelligent Control and Artificial Intelligence
- Publisher
- ACM
- Published
- 2020-10-17
- Pages
- 296-301
- OpenAlex
- W3116386889
- Cited by
- 33
- References
- 6
- FWCI
- 1.41
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.