Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2022
DOI: 10.1145/3548606.3560687
|View full text |Cite
|
Sign up to set email alerts
|

Federated Boosted Decision Trees with Differential Privacy

Abstract: How to cite:Please refer to published version for the most recent bibliographic citation information. If a published version is known of, the repository item page linked to above, will contain details on accessing it.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(14 citation statements)
references
References 40 publications
0
13
0
Order By: Relevance
“…This enables us to design an efficient privacy auditing method for federated learning. The closest related work is CANIFE [Maddock et al, 2022], whose goal is also to perform privacy auditing of federated learning models. Compared to CANIFE, our technique requires minimal assumptions on adversarial knowledge (as the adversary crafts random canaries for poisoning model updates), and are effective for a range of adversarial models, including realistic adversaries with access only to the final model.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…This enables us to design an efficient privacy auditing method for federated learning. The closest related work is CANIFE [Maddock et al, 2022], whose goal is also to perform privacy auditing of federated learning models. Compared to CANIFE, our technique requires minimal assumptions on adversarial knowledge (as the adversary crafts random canaries for poisoning model updates), and are effective for a range of adversarial models, including realistic adversaries with access only to the final model.…”
Section: Discussionmentioning
confidence: 99%
“…A canary update that was not observed in training will have vanishing cosine with the final model, while the cosine with one that was observed will be positive. Prior work has attempted to craft a canary example/update by finding an example/vector that is orthogonal to the clean data update [Maddock et al, 2022;Nasr et al, 2021]. Such approaches require knowledge of the model gradients, but we argue this is unnecessary for high dimensional models, because all vectors are nearly orthogonal to each other with high probability.…”
Section: Privacy Estimation For Fl With Random Canariesmentioning
confidence: 99%
See 2 more Smart Citations
“…To analyze such data, deep learning algorithms may require complex neuron-based training with high overheads. Conversely, tree-based learning models show advantages in accurate performance and easy deployment [2,9]. To drive the ensemble tree-based model to play its advantages in FLbased attack detection service on IoT edge, there is still a lack of discussion and solutions to efficiently coordinate the tree-based FL design with the in-network ML-based attack detection in distributed IoT scenario.…”
Section: Introductionmentioning
confidence: 99%