Umeå universitets logga

umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Rakshit: attacking and defending federated learning with decision trees
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.ORCID-id: 0000-0002-4896-7849
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.ORCID-id: 0000-0002-0368-8037
(Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
Abstract [en]

In Federated Learning (FL), two or more devices collaboratively learn a model without sharing the data. However, it has been studied that sharing model parameters can lead to substantial privacy leakage. We study an FL framework for training Gradient Boosting Decision Trees (GBDT), which is Weighted Gradient Boosting Decision Trees (WGBDT), where an aggregated gradient of all similar records from different devices is used for updating the gradients for building trees for each device. One of the approaches for determining similar records among different devices is the Locality Sensitive Hashing (LSH), which places similar records in the same bucket and dissimilar records in different buckets. Hence, WGBDT uses the aggregated gradient of similar samples while training a GBDT model for each distributed device. WGBDT assumes that each device knows the hash values of other devices' records. Using two data reconstruction attacks, we show that this assumption compromises individual privacy. When the number of LSH functions (L) is bigger than the data dimension (d), we can reconstruct more than 90% of the training data. We also show that even when L < d, significant data reconstruction is still possible. We propose Rakshit, which adds another layer of anonymization using Mondrian. We show that the reconstruction accuracy is less in Rakshit. However, some reconstruction is still possible. Our findings provide useful insights for research in privacy-preserving FL for training GBDT.

Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:umu:diva-230672OAI: oai:DiVA.org:umu-230672DiVA, id: diva2:1904440
Tillgänglig från: 2024-10-09 Skapad: 2024-10-09 Senast uppdaterad: 2024-10-09
Ingår i avhandling
1. Navigating data privacy and utility: a strategic perspective
Öppna denna publikation i ny flik eller fönster >>Navigating data privacy and utility: a strategic perspective
2024 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Alternativ titel[sv]
Navigera i datasekretess och verktyg : ett strategiskt perspektiv
Abstract [en]

Privacy in machine learning should not merely be viewed as an afterthought; rather, it must serve as the foundation upon which machine learning systems are designed. In this thesis, along with the centralized machine learning, we also consider the distributed environments for training machine learning models, particularly federated learning. Federated learning lets multiple clients or organizations train a machine learning model in a collaborative manner without moving their data. Each client participating to the federation shares the model parameters learnt by training a machine learning model on its data. Even though the setup of federated learning keeps the data local, there is still a risk of sensitive information leaking through the model updates. For instance, attackers could potentially use the updates of the model parameters to figure out details about the data held by clients. So, while federated learning is designed to protect privacy, it still faces challenges in ensuring that the data remains secure throughout the training process. 

Originally, federated learning was introduced in the context of deep learning models. However, this thesis focuses on federated learning for decision trees. Decision Trees are intuitive, and interpretable models, making them popular in a wide range of applications, especially where explanability of the decisions made by the decision tree model is important. However, Decision Trees are vulnerable to inference attacks, particularly when the structure of the decision tree is exposed. To mitigate these vulnerabilities, a key contribution of this thesis is the development of novel federated learning algorithms that incorporate privacy-preserving techniques, such as $k$-anonymity and differential privacy, into the construction of decision trees. By doing so, we seek to ensure user privacy without significantly compromising the performance of the model. Machine learning models learn patterns from data, and during this process, they might leak sensitive information. Each step of the machine learning pipeline presents unique vulnerabilities, making it essential to assess and quantify the privacy risks involved. One focus of this thesis is the quantification of privacy by devising a data reconstruction attack tailored to Principal Component Analysis (PCA), a widely used dimensionality reduction technique. Furthermore, various protection mechanisms are evaluated in terms of their effectiveness in preserving privacy against such reconstruction attacks while maintaining the utility of the model. In addition to federated learning, this thesis also addresses the privacy concerns associated with synthetic datasets generated by models such as generative networks. Specifically, we perform an Attribute Inference Attack on synthetic datasets, and quantify privacy by calculating the Inference Accuracy—a metric that reflects the success of the attacker in estimating sensitive attributes of target individuals.

Overall, this thesis contributes to the development of privacy-preserving algorithms for decision trees in federated learning and introduces methods to quantify privacy in machine learning systems. Also, the findings of this thesis set a ground for further research at the intersection of privacy, and machine learning.

Ort, förlag, år, upplaga, sidor
Umeå: Umeå University, 2024. s. 103
Serie
UMINF, ISSN 0348-0542 ; 24.10
Nyckelord
Privacy, Data Reconstruction Attacks, k-anonymity, Differential Privacy, Federated Learning, Decision Trees, Principal Component Analysis
Nationell ämneskategori
Datavetenskap (datalogi) Annan teknik
Identifikatorer
urn:nbn:se:umu:diva-230616 (URN)978-91-8070-481-6 (ISBN)978-91-8070-482-3 (ISBN)
Disputation
2024-11-04, BIO.A.206 Aula Anatomica, Biologihuset, 09:15 (Engelska)
Opponent
Handledare
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Tillgänglig från: 2024-10-14 Skapad: 2024-10-08 Senast uppdaterad: 2024-10-24Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Person

Kwatra, SaloniTorra, Vicenç

Sök vidare i DiVA

Av författaren/redaktören
Kwatra, SaloniTorra, Vicenç
Av organisationen
Institutionen för datavetenskap
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 119 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf